QuickHeapsort, an efficient mix of classical sorting algorithms
From MaRDI portal
Publication:1608335
DOI10.1016/S0304-3975(01)00288-2zbMath1016.68042MaRDI QIDQ1608335
Domenico Cantone, Gianluca Cincotti
Publication date: 5 August 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
- A variant of heapsort with almost optimal number of comparisons
- The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\)
- An average case analysis of Floyd's algorithm to construct heaps
- Implementing Quicksort programs
- Building heaps fast