The heap-mergesort

DOI10.1016/S0898-1221(00)00075-4zbMath0956.68045OpenAlexW2059711221MaRDI QIDQ1568737

N. Delaunay

Publication date: 21 June 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(00)00075-4

zbMATH Keywords

mergesort algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Optimal heapsort algorithm
• Heaps with bits
• The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\)
• Building heaps fast
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The heap-mergesort