A Comparative and performance Analysis of different types of Sorting Algorithms in Data Structure for efficient output

Simarjeet Singh Bhatia, Ronak Jain, Dinesh Chandra Jain


This research paper presents the different types of sorting algorithms of data structure like quick, heap and merge and also gives their performance analysis with respect to time complexity. These three algorithms have been an area of focus for a long time but still the question remains the same of “which to use when?” which is the main reason to perform this research. This research provides a detailed study of how all the three algorithms work and then compares them on the basis of various parameters apart from time complexity to reach our conclusion.


Quick sort, Heap sort, Merge sort, time complexity, other performance parameters.

Full Text:



  • There are currently no refbacks.