Skip Navigation

The Computer Journal 1993 36(3):286-288; doi:10.1093/comjnl/36.3.286
© 1993 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Wegener, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly

I. Wegener *

FB Informatik, Universitat Dortmund, Postfach 500 500 4600 Dortmund 50, Germany

Xunrang and Yuzhang have presented the HEAPSORT variant NEWheapsort whose worst case complexity is (4/3)n log2n+O(n). By a simple modification this algorithm can be improved to have a better average case complexity and a worst case complexity of only (7/6)n log2n+O(n).

Received April 1992.

* FB Informatik, Universität Dortmund, Postfach 500 500 4600 Dortmund 50, Germany


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.