Near Optimal Heap

DOI10.1093/COMJNL/42.5.391MaRDI QIDQ4935300zbMATH OpenOpenAlexFDO

Authors Robert W. P. Luk

Publication date 31 January 2000

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/42.5.391

zbMATH Keywords

\(\beta\) heapsort performance

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Optimal heapsort algorithm
• Heap construction: Optimal in both worst and average cases?
• scientific article; zbMATH DE number 3856423
• Heaps and heapsort on secondary storage
• Building heaps fast

Cited in

(2)

• Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
• A tight lower bound for top-down skew heaps

This page was built for publication: Near Optimal   Heap

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