微信服务号

微信订阅号

2025-6-6- 19
Home > Archive>Volume 5, Issue 1, 1994 >33-36
PDF HTML XML Export Cite reminder
OPTIMAL ALGORITHM OF HEAPSORT
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [1]
    • |
  • Related
    • |
  • Cited by [3]
    • | |
  • Comments
    Abstract:

    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.

    Reference
    1 Horowitz E,Sahni S．Fundamentals of computer algorithms．Computer Science Press，Inc．，1978；61—70． 2 Alfred V Aho，John E Hopcroft，Jeffrey D Ullman．The design and analysis of computer algorithms．Addison Wesley，Reading，Mass．，1975：86—92． 3 Donald E Knuth. The art of computer programming．Vol．3，Sorting and Searching，Addison—Wesley Publishing Company，Ine．，1973：145—149，158． 4 朱洪等．计算机算法；设计与分析引论．上海：复旦大学出版社，1985：78—85． 5 曹新谱．算法设计与分析．长沙：湖南科学技术出版社，1984：70一75．
    Related
    Comments
    Comments
    分享到微博
    Submit
Get Citation

顾训穰,诸宇章.堆整序的最优算法.软件学报,1994,5(1):33-36

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 20,1990
  • Revised:July 29,1991
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2052009Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063