Average-case results on heapsort
Author:
- 1 March 1987
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 27 (1) , 2-17
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An average case analysis of Floyd's algorithm to construct heapsInformation and Control, 1984
- Data Structures and Algorithms 11984
- Deleting the root of a heapActa Informatica, 1982
- Inserting a new element into a heapBIT Numerical Mathematics, 1981
- Random insertion into a priority queue structureIEEE Transactions on Software Engineering, 1975
- Algorithm 245: TreesortCommunications of the ACM, 1964
- Algorithm 230: Matrix PermutationCommunications of the ACM, 1964