A Comparative Study of Well Known Sorting Algorithms
Main Article Content
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 .
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
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.