BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
- 13 September 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 118 (1) , 81-98
- https://doi.org/10.1016/0304-3975(93)90364-y
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Short Note: A new HEAPSORT Algorithm and the Analysis of Its ComplexityThe Computer Journal, 1990
- Building heaps fastJournal of Algorithms, 1989
- A variant of heapsort with almost optimal number of comparisonsInformation Processing Letters, 1987
- Average-case results on heapsortBIT Numerical Mathematics, 1987
- An average case analysis of Floyd's algorithm to construct heapsInformation and Control, 1984
- Deleting the root of a heapActa Informatica, 1982
- The analysis of Quicksort programsActa Informatica, 1977
- Increasing the efficiency of quicksortCommunications of the ACM, 1970
- Algorithm 245: TreesortCommunications of the ACM, 1964
- QuicksortThe Computer Journal, 1962