Abstract:

Today there are several efficient algorithms that cope with the popular task of sorting. This paper titled Comparative Performance Study of Improved Heap Sort Algorithm and other sorting Algorithms presents a comparison between classical sorting algorithms and improved heap sort algorithm. To have some experimental data to sustain these comparisons three representative algorithms were chosen (classical Heap sort, quick sort and merge sort). The improved Heap sort algorithm was compared with some experimental data of classical algorithms on two different platforms that lead to final conclusions.
Keywords: Complexity, Performance of algorithms, Asymptotic notation