The Analysis of Heapsort
From MaRDI portal
Publication:3141523
DOI10.1006/jagm.1993.1031zbMath0789.68072WikidataQ56448074 ScholiaQ56448074MaRDI QIDQ3141523
Russel Schaffer, Robert Sedgewick
Publication date: 6 December 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2f918427b41bef546b8225f5fb32c0b1edd67860
Related Items
A Tight Bound on the Worst-Case Number of Comparisons for Floyd’s Heap Construction Algorithm, Homogeneous and Non-homogeneous Algorithms, Fractal Analysis of Pi Normality, Average-case analysis via incompressibility, Heaps with bits, Multiway in-place merging, \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis, 3 is more promising algorithmic parameter than 2, Recurrence relations on heaps, Entropy conservation for comparison-based algorithms, Optimizing binary heaps