scientific article; zbMATH DE number 1444318

zbMATH Open0951.68506MaRDI QIDQ4953348FDOQ4953348

Authors: Jyrki Katajainen 

Publication date: 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

ultimate heapsort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (11)

• A variant of heapsort with almost optimal number of comparisons
• Title not available (Why is that?)
• The weak-heap data structure: variants and applications
• Title not available (Why is that?)
• An in-place priority queue with \(O(1)\) time for push and \(\lg n + O(1)\) comparisons for pop
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons
• A Note on HEAPSORT
• QuickXsort: a fast sorting scheme in theory and practice
• Optimizing binary heaps
• QuickHeapsort, an efficient mix of classical sorting algorithms
• The heap-mergesort

This page was built for publication:

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