A new heapsort algorithm is given in this paper. Its practical value i
s that the efficiency of it is two times as high as that of the origin
al algorithm in Horowitz and Sahni (1978). Also, its theoretical signi
ficance lies in the order and the main term coefficient of the complex
ity has optimal performance.