An optimal algorithm for deleting the root of a heap
- 31 January 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 37 (2), 117-120
- https://doi.org/10.1016/0020-0190(91)90144-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A variant of heapsort with almost optimal number of comparisonsInformation Processing Letters, 1987
- Average-case results on heapsortBIT Numerical Mathematics, 1987
- Heaps on HeapsSIAM Journal on Computing, 1986
- Algorithm 245: TreesortCommunications of the ACM, 1964
- AlgorithmsCommunications of the ACM, 1964