Weak-heap sort

DOI10.1007/BF01990520zbMath1408.68043OpenAlexW2042509780MaRDI QIDQ1314628

Ronald D. Dutton

Publication date: 14 November 1995

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01990520

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (13)

An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons ⋮ Regular numeral systems for data structures ⋮ An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop ⋮ Optimizing binary heaps ⋮ Weak heaps engineered ⋮ The weak-heap data structure: variants and applications ⋮ Homogeneous and Non-homogeneous Algorithms ⋮ Bipartite binomial heaps ⋮ Heaps with bits ⋮ QuickHeapsort: modifications and improved analysis ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ A Survey on Priority Queues ⋮ A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY

Uses Software

• heapsort

Cites Work

• Average-case results on heapsort
• The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\)
• A data structure for manipulating priority queues
• Building heaps fast
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak-heap sort