期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2008
卷号：8
期号：4
页码：101-105
出版社：International Journal of Computer Science and Network Security
摘要：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.
关键词：Complexity, Performance of algorithms, Asymptotic notation
