A Comparative Study of Well Known Sorting Algorithms

Main Article Content

Kazim Ali

Abstract

In computer science sorting is much basic and important problem. Sorting is also a fundamental problem in algorithm analysis and designing point of view. Therefore many computer scientists have much worked on sorting algorithms. Therefore as a computer science student, I also want to work on existing sorting algorithms and presenting my findings after studying some well-known sorting algorithms which are Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Heap Sort, Quick Sort, Counting Sort, Bucket Sort and Radix Sort. In this paper, we will study these algorithms and their time complexities. Time complexity is much important factor of success and popularity of any sorting algorithm. Time complexity means the running time of algorithms on a virtual machine or a real machine. The stability and in-placing of above algorithms will also discuss .Therefor time complexity comparisons are done in this paper and also determine the conditions where a specific algorithm is best. I will also present some related work of different people. My own comments and opinions on the previous related work will also be the part of this paper.

Keywords: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Heap Sort, Quick Sort, Counting Sort, Bucket Sort, Radix Sort, Time Complexity, Comparison .

Downloads

Download data is not yet available.

Article Details

Section
Articles