QuickHeapsort, an efficient mix of classical sorting algorithms

DOI10.1016/S0304-3975(01)00288-2zbMath1016.68042OpenAlexW2517692465MaRDI QIDQ1608335

Domenico Cantone, Gianluca Cincotti

Publication date: 5 August 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00288-2

zbMATH Keywords

analysis of algorithmsquicksortin-place sortingheapsort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Further analysis of the remedian algorithm ⋮ Unnamed Item ⋮ QuickHeapsort: modifications and improved analysis ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ QuickHeapsort

Uses Software

• LEDA
• Quicksort
• Find

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: QuickHeapsort, an efficient mix of classical sorting algorithms