Skip Navigation

The Computer Journal 1990 33(3):281-282; doi:10.1093/comjnl/33.3.281
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Xunrang, G.
Right arrow Articles by Yuzhang, Z.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

A new HEAPSORT Algorithm and the Analysis of Its Complexity

G. Xunrang * and Z. Yuzhang

Computer Science Department, Shanghai University of Science and Technology, Shanghai, China

Heapsort algorithm HEAPSORT is widely used for its high efficiency and well-defined data structure. A new heapsort algorithm is given in this paper that makes the constant factor of the complexity smaller. And it does a comparative analysis of this algorithm with those that have been designed.

Received April 1988. revised February 1989.

* To whom correspondence should be addressed.

§ Computer Science Department, Shanghai University of Science and Technology, Shanghai, PR China


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.