| 关于堆排序的一种新型算法 |
| |
| 引用本文： | 吴晓红,郭改霞. 关于堆排序的一种新型算法[J]. 数值计算与计算机应用, 2000, 21(4): 303-307 |
| |
| 作者姓名： | 吴晓红 郭改霞 |
| |
| 作者单位： | 1. 广东中山学院计算机系, 中山, 528403
2. 长沙交通学院计算机系, 长沙, 410076 |
| |
| 摘 要： |
|
| 修稿时间： | 1998-12-15 |
ON A NEW ALGORITHM OF HEAPSORT |
| |
| Wu Xiao-hong,Guo Gai-xia. ON A NEW ALGORITHM OF HEAPSORT[J]. Journal on Numerical Methods and Computer Applications, 2000, 21(4): 303-307 |
| |
| Authors: | Wu Xiao-hong Guo Gai-xia |
| |
| Abstract: | 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%. |
| |
| Keywords: | second order heapsort optimum data processing algorithm |
| 本文献已被 万方数据 等数据库收录！ |
|
