Analysis of Comparison-Based Sorting Algorithms

With the expansion of computing, random and unorder data on the internet is also increasing. The searching of useful information from this scattered data has become a critical problem. To solve this problem, researchers has devoted a lot of efforts by developing new approaches and algorithms. They are still working on it to improve the results to be more efficient, fast, and reliable. Sorting is an approach used to organize unordered data. There are many sorting algorithms that helps to extract meaningful information and use it for problem solving. In this paper, the functioning of six sorting algorithms is explained with the help of various factors: algorithm, stability, adaptability, time complexity, and their pros and cons.

I. Introduction

In this era of computing, it is always a problem to manage huge amount of data in a specific manner. For this purpose, sorting is the procedure of managing and arranging data into a specific order and also optimize data searching. The sorted data is convenient for inserting, deleting, and updating a specific item. It makes the data more readable and manageable. In sorting, we have numerous elements suppose s₁, s₂, s₃ …s_n shows input data and it must determine the output data as s₁ ≤ s₂ ≤ s₃…≤ s_n [1]. Sorting is used in multiple computer applications. For example, in database applications, it manages information in a sensible and meaningful sequence such as ascending or descending order, alphabetically order, order according to name, id, department, and designation. There are various types of sorting algorithms which are used to solve ordering problems.