论文部分内容阅读
In this paper, a new algorithm of heapsort, called second order heapsort, is suggested. It is proved that the average time complexity of the algorithm is O(n log2 n) and the speed of the algorithm, which has used optimum data processing method, is hei