OPTIMAL ALGORITHM OF HEAPSORT
堆整序的最优算法

A new heapsort algorithm is given in this paper. Its practical value is that the efficiency of it is two times as high as that of the former algorithm.Also,its theoretical significance lies in the order and the main term coefficient of the complexity being of optimal performance.