An average case analysis of Floyd's algorithm to construct heaps
- 31 May 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 61 (2) , 114-131
- https://doi.org/10.1016/s0019-9958(84)80053-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Continuous models that are equivalent to randomness for the analysis of many sorting algorithmsComputing, 1983
- Asymptotic estimates for the higher moments of the expected behavior of straight insertion sortInformation Processing Letters, 1982
- Algorithm 245: TreesortCommunications of the ACM, 1964