Contrastive analysis of bubble &amp; merge sort proposing hybrid approach

Cheema, Sehrish Munawar; Sarwar, Nadeem; Yousaf, Fatima

doi:10.1109/intech.2016.7845075

Cited by 25 publications

(17 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Bubble Sort is an algorithm that works by comparing and swapping two elements if it is not sorted, and performing iterations to get the sorted result. It is one of the simplest and basic algorithms a person can learn and use to get an understanding of algorithms and also is efficient in terms of space complexity because it does all its work in temporary memory [15]. Its Time Complexity is O(n^2) which is not faster than other algorithms but as this paper discuss there are situations where developers need to implement and the best fit can be bubble sort but this paper is here to see if these algorithms can perform any better despite languages [16][17].…”

Section: Bubble Sortmentioning

confidence: 99%

Analysis of Merge Sort and Bubble Sort in Python, PHP, JavaScript, and C language

2021

IJATCSE

View full text Add to dashboard Cite

Computer Science is all about the solving problems with the help of algorithms and sorting is one of the basic operations for any problem solving method. In sorting, the arrangement of data or objects in any particular order is done with the help of algorithms. There is more than one method available and also includes a wide range of choices in a programming language. These languages serve a different purpose in their field of the area but some can be used interchangeably for the same purpose especially for a server-side language like JavaScript can also implement for server-side tasks and right now it is being widely used all over the internet. Here this paper analyzed these languages with merge sort and bubble sort with the languages of the latest public stable versions for an idea of the performance of these languages because they are pretty much interchangeable for different uses in the market the only difference these server side languages have is their architecture. This paper compared these languages’ capabilities with merge sort and bubble sort by executing them and observing them in terms of time by giving them different numbers of inputs. Analytics used an array of 2500, 5000, 7500, and 10000 lengths of an array that passes through these algorithms and noted the execution time to get a better idea of the capabilities of these languages. With this method, observes that in the latest public version of all languages python performs faster in merge sort while JavaScript performs better in bubble sort in executing 10000 inputs.

show abstract

Section: Bubble Sortmentioning

confidence: 99%

Analysis of Merge Sort and Bubble Sort in Python, PHP, JavaScript, and C language

2021

IJATCSE

View full text Add to dashboard Cite

show abstract

“…According to Eqs. (21) and 14, q can be evaluated by the homography decomposition. Then, the auxiliary error signals can be obtained using Eqs.…”

Section: Homography Calculation and Decompositionmentioning

confidence: 99%

“…(21), as shown in Figure 7. The filter sorts the collects five sets of pose data using the bubble sort algorithm [21].…”

Section: Adaptive Median Filter For Pose Estimationmentioning

confidence: 99%

Visual Servo Control of a Legged Mobile Robot Based on Homography

Liu¹,

Zhang²,

Wang³

et al. 2020

Preprint

View full text Add to dashboard Cite

Due to the intermittent motion of a legged mobile robot, an additional periodic movement must be introduced that directly affects the image processing accuracy and destabilizes the visual servo control of the robot. To address this problem, this paper investigates a control scheme for the visual servoing of a legged mobile robot equipped with a fixed monocular camera. The kinematics of the legged mobile robot and homography- based visual servoing are employed to allow the robot to achieve the desired pose. By investigating the homographic relationship between the current and desired poses, the approach has no need for transcendental knowledge of the three-dimensional geometry of the target image. The feature points are directly extracted from the images to evaluate the homography matrix. To reduce the effects caused by the intermittent motions of the legged robot, an improved adaptive median filter is proposed. Furthermore, a sliding mode controller is designed, and a Lyapunov-based approach is used to analyze the stability of the control system. With the aid of CoppeliaSim software, a simulation is implemented to verify the effectiveness of the proposed method.

show abstract

“…Buffering and reading from input strings were presented by Zhang and Larson [32]. Merge sort was also evaluated in various tests and benchmarks by Vignesh and Pradhan [33], Cheema et al [34], and Paira et al [35]. These research results show that merge sort has a very high potential for new improvements.…”

Section: Introductionmentioning

confidence: 99%

Fully Flexible Parallel Merge Sort for Multicore Architectures

2018

View full text Add to dashboard Cite

The development in multicore architectures gives a new line of processors that can flexibly distribute tasks between their logical cores. These need flexible models of efficient algorithms, both fast and stable. A new line of efficient sorting algorithms can support these systems to efficiently use all available resources. Processes and calculations shall be flexibly distributed between cores to make the performance as high as possible. In this article we present a fully flexible sorting method designed for parallel processing. The idea we describe in this article is based on modified merge sort, which in parallel form is designed for multicore architectures. The novelty of this idea is in particular way of processing. We have developed a fully flexible method that can be implemented for a number of processors. The tasks are flexibly distributed between logical cores to increase the efficiency of sorting. The method preserves separation of concerns; therefore, each of the processors works separately without any cross actions and interruptions. The proposed method was described in theoretical way, examined in tests, and compared to other methods. The results confirm high efficiency and show that with each newly added processor sorting becomes faster and more efficient.

show abstract

Contrastive analysis of bubble & merge sort proposing hybrid approach

Cited by 25 publications

References 2 publications

Analysis of Merge Sort and Bubble Sort in Python, PHP, JavaScript, and C language

Analysis of Merge Sort and Bubble Sort in Python, PHP, JavaScript, and C language

Visual Servo Control of a Legged Mobile Robot Based on Homography

Fully Flexible Parallel Merge Sort for Multicore Architectures

Contact Info

Product

Resources

About