Sorting using heap structure

DOI10.1080/00207160108805071zbMath0982.68054OpenAlexW1995721014MaRDI QIDQ2752277

Mohammad Kaykobad, Rezaul Alam Chowdhury

Publication date: 16 October 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160108805071

zbMATH Keywords

sorting algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

Event-Driven Simulation Scheme for Spiking Neural Networks Using Lookup Tables to Characterize Neuronal Dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heaps with bits
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• Average-case results on heapsort
• A variant of heapsort with almost optimal number of comparisons
• The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\)
• Heaps on Heaps
• Building heaps fast

This page was built for publication: Sorting using heap structure