]*>","")" /> 关于堆排序的一种新型算法

• 论文 • 上一篇    下一篇

关于堆排序的一种新型算法

吴晓红,郭改霞   

  1. 广东中山学院计算机系!中山;528403;长沙交通学院计算机系!长沙;410076
  • 出版日期:2000-04-20 发布日期:2000-04-20

吴晓红,郭改霞. 关于堆排序的一种新型算法[J]. 数值计算与计算机应用, 2000, 21(4): 303-307.

ON A NEW ALGORITHM OF HEAPSORT

  1. Wu Xiao-hong (Department of Computer Engineering, Zhongshan College, Zhongshan, Guangdong, 528403, P.R.China) Guo Gai-xia (Department of Computer Engineering, Changsha Communications University, Changsha, 410076, P.R.China)
  • Online:2000-04-20 Published:2000-04-20
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%.
()

[1]D. E克努著,管纪文等译,计算机程序设计技巧,国防工业出版社, 8(1984), 119-159.
[2]顾洲,渚宇章,堆整序的改进算法及其复杂性分析,计算机学报,B 4(1990).
[3]卢开澄,算法与复杂性,高等教育出版社, 5(1995),155-160.
[4]唐开山,大数据量处理中的 C指针及运算效率,微计算机应用, 18:1(1997), 40-42.
No related articles found!
阅读次数
全文


摘要