An average case analysis of Floyd's algorithm to construct heaps
From MaRDI portal
Publication:3718164
DOI10.1016/S0019-9958(84)80053-4zbMath0589.68046WikidataQ62022769 ScholiaQ62022769MaRDI QIDQ3718164
Publication date: 1984
Published in: Information and Control (Search for Journal in Brave)
68P10: Searching and sorting
Related Items
BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small), 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\), Best case lower bounds for heapsort, QuickHeapsort, an efficient mix of classical sorting algorithms, Recurrence relations on heaps, A Survey on Priority Queues, A stochastic interpretation of propositional dynamic logic: expressivity