The ultimate heapsort

MaRDI QIDQ4953348zbMATH OpenFDO

Authors Jyrki Katajainen

Publication date 1998

zbMATH Keywords

ultimate heapsort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A variant of heapsort with almost optimal number of comparisons
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• On the Best Case of Heapsort
• Sorting using heap structure
• A Note on HEAPSORT

Cited in

(12)

• A variant of heapsort with almost optimal number of comparisons
• The heap-mergesort
• QuickHeapsort, an efficient mix of classical sorting algorithms
• The weak-heap data structure: variants and applications
• QuickXsort: a fast sorting scheme in theory and practice
• Optimizing binary heaps
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons
• An in-place priority queue with O(1) time for push and n + O(1) comparisons for pop
• scientific article; zbMATH DE number 4195160 (Why is no real title available?)
• A Note on HEAPSORT
• On the Best Case of Heapsort
• scientific article; zbMATH DE number 7359768 (Why is no real title available?)

This page was built for publication: The ultimate heapsort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953348)