High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Comparision of Sorting Algorithms on Linux Platform


Hiteshri Patel , Raksha Shakti university ; Ravi K Sheth, Raksha Shakti university


Complexity, Insertion sort, Selection sort, Merge sort, Best case, Average case and Worst case


In this paper, we have implemented different types of sorting algorithms like Insertion sort, Selection sort and Merge sort on Linux platform and find the time complexity of these algorithm for Best case, Average case and Worst case. As the number of data increases then it affects the efficiency of the algorithms.

Other Details

Paper ID: IJSRDV2I12392
Published in: Volume : 2, Issue : 12
Publication Date: 01/03/2015
Page(s): 795-796

Article Preview

Download Article