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.