An Analysis of Different Sorting Algorithms in Terms of Time Complexity |
Author(s): |
| Pratap K Mishra , Raksha Shakti university ; Ravi K Sheth, Raksha Shakti university |
Keywords: |
| Algorithm, Time Complexity, Selection sort, Insertion sort, Merge sort, Quick sort |
Abstract |
|
Sorting algorithms are usually judged by their efficiency. In this case, efficiency refers to the algorithmic efficiency as the size of the input grows large and is generally based on the number of elements to sort. In this paper, we have implemented different sorting algorithm on Linux platform. We have also measured running time of sorting algorithms and prepared comparative analysis. For the study purpose we have chosen Insertion, Selection, Merge and Quick Sort for the analysis in term of worst, average, and best case. |
Other Details |
|
Paper ID: IJSRDV2I12297 Published in: Volume : 2, Issue : 12 Publication Date: 01/03/2015 Page(s): 742-743 |
Article Preview |
|
|
|
|
