摘要
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 heightened 180%.
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 heightened 180%.
出处
《数值计算与计算机应用》
CSCD
北大核心
2000年第4期303-307,共5页
Journal on Numerical Methods and Computer Applications
