数值计算与计算机应用
數值計算與計算機應用
수치계산여계산궤응용
JOURNAL ON NUMERICAL METHODS AND COMPUTER APPLICATIONS
2000年
4期
303-307
,共5页
second order heapsort%optimum data processing%algorithm
In this paper, a new algorithm of heapsort, called second orderheapsort, is suggested. It is proved that the average time complexityof the algorithm is O(n 2 n) and the speed of the algorithm,which has used optimum data processing method, is heightened 180%.
