摘要
本文给出堆整序的一个新算法，其实用价值比以前的算法效率提高一倍，其理论意义是在复杂性的数量级和主项系数方面已具有最优性能．
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.
出处
《软件学报》
EI
CSCD
北大核心
1994年第1期33-36,共4页
Journal of Software
关键词
Heapsort算法
堆整序
Heap
sorting by comparision
algorithm
computational complexity.
