Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n

DOI10.1145/944618.944623zbMath1075.68672OpenAlexW2075298227MaRDI QIDQ5463432

Patrick Stiegeler, Stefan Edelkamp

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.jea.acm.org/2002/EdelkampHeapsort/

zbMATH Keywords

weak-heap-sort algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Weak heaps engineered ⋮ The weak-heap data structure: variants and applications ⋮ Homogeneous and Non-homogeneous Algorithms ⋮ QuickHeapsort: modifications and improved analysis ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ A Survey on Priority Queues

This page was built for publication: Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n