Performance Comparison between Merge and Quick Sort Algorithms in Data Structure

Ali, Irfan; Nawaz, Haque; Khan, Imran; Maitlo, Abdullah; Chhajro, M. Ameen; Rind, M. Malook

doi:10.14569/ijacsa.2018.091127

Cited by 5 publications

(5 citation statements)

References 4 publications

(3 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Procedure 1 returns sorted list of top-k parkings, with empty lots to Algorithm 1. e sorting process is performed using merge sort algorithm [34].…”

Section: Multilevel Filteringmentioning

confidence: 99%

Multicriteria Decision Making for Carbon Dioxide (CO2) Emission Reduction

Ali

Iqbal

Zada

2022

Scientific Programming

View full text Add to dashboard Cite

The fast industrial revolution all over the world has increased emission of carbon dioxide (CO2), which has badly affected the atmosphere. Main sources of CO2 emission include vehicles and factories, which use oil, gas, and coal. Similarly, due to the increased mobility of automobiles, CO2 emission increases day-by-day. Roughly, 40% of the world’s total CO2 emission is due to the use of personal cars on busy and congested roads, which burn more fuel. In addition to this, the unavailability of parking in all parts of the cities and the use of conventional methods for searching parking areas have added more to this problem. To solve the problem of reducing CO2 emission, a novel cloud-based smart parking methodology is proposed. This methodology enables drivers to automatically search for nearest parking(s) and recommend the most preferred ones that have empty lots. For determining preferences, the methodology uses the analytical hierarchy process (AHP) of multicriteria decision-making methods. For aggregating the decisions, the weighted sum model (WSM) is adopted. The methods of sorting, multilevel multifeatures filtering, exploratory data analysis (EDA), and weighted sum model (WSM) are used for ranking parking areas and recommending top-k parking to the drivers for parking their cars. To implement the methodology, a scenario comprising cars, smart parkings are considered. To use EDA, a freely available dataset “2020testcar-2020-03-03” is used for the estimation of CO2 emitted by cars. For evaluation purpose, the results obtained are compared with the results of traditional approach. The comparison results show that the proposed methodology outperforms the traditional approach.

show abstract

“…Procedure 1 returns sorted list of top-k parkings, with empty lots to Algorithm 1. e sorting process is performed using merge sort algorithm [34].…”

Section: Multilevel Filteringmentioning

confidence: 99%

Multicriteria Decision Making for Carbon Dioxide (CO2) Emission Reduction

Ali

Iqbal

Zada

2022

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…In another research, a paper researcher has shown the time complexity of improved algorithm Bubble sort in C programming language for that researcher has used data length of 1,000 to 10,000 and the software used by the researcher for running C language was turbo C++. The researcher has shown a graph in which he has compared the result for the bubble sort algorithm and its improved version in which algorithm works more efficiently than the traditional algorithm of Bubble sort [2].…”

Section: Literature Reviewmentioning

confidence: 99%

Comparison of Bubble and Insertion Sort in Rust and Python Language

2021

IJATCSE

View full text Add to dashboard Cite

Sorting is the basic activity in the field of computer science and it is commonly used in searching for information and data. The main goal of sorting is to make reports or records easier to edit, delete and search, etc. It organizes the given data in any sequence. There are many sorting algorithms like insertion sort, bubble sort, radix sort, heap sort, and so forth. Bubble sort and insertion sort are clearly described with algorithms and examples. In this paper, the bubble sort and insertion sort performance analysis is carried out by calculating the time complexity. These algorithm time complexities have been calculated by implementing in the rust and python languages and observed the best case, average case, and worst case. The flowchart shows the complete workflow of this study. The results have been shown graphically and time complexity has been shown in a tabular form. We have compared the efficiency of bubble sort and insertion sort algorithms in the rust and python platforms. The rust language is more efficient than python for both bubble and insertion sort algorithms. However, it is observed insertion sort is more efficient than the bubble sort algorithm.

show abstract

“…Developers cannot use any algorithm without any consultation with the prediction of the situation that the program can get the benefit from that algorithm. [20].…”

Section: Merge 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

Performance Comparison between Merge and Quick Sort Algorithms in Data Structure

Cited by 5 publications

References 4 publications

Multicriteria Decision Making for Carbon Dioxide (CO2) Emission Reduction

Multicriteria Decision Making for Carbon Dioxide (CO2) Emission Reduction

Comparison of Bubble and Insertion Sort in Rust and Python Language

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

Contact Info

Product

Resources

About