Best case lower bounds for heapsort
From MaRDI portal
Publication:1195788
DOI10.1007/BF02238646zbMath0756.68050MaRDI QIDQ1195788
Publication date: 13 January 1993
Published in: Computing (Search for Journal in Brave)
Uses Software
Cites Work
- An optimal algorithm for deleting the root of a heap
- Average-case results on heapsort
- A variant of heapsort with almost optimal number of comparisons
- On the random construction of heaps
- Average case analysis of heap building by repeated insertion
- An average case analysis of Floyd's algorithm to construct heaps
- Heaps on Heaps
- Building heaps fast