Continuous models that are equivalent to randomness for the analysis of many sorting algorithms
- 1 March 1983
- journal article
- Published by Springer Nature in Computing
- Vol. 31 (1) , 11-31
- https://doi.org/10.1007/bf02247934
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Deleting the root of a heapActa Informatica, 1982
- Inserting a new element into a heapBIT Numerical Mathematics, 1981
- Some observations on the average behavior of heapsortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Implementation and Analysis of Binomial Queue AlgorithmsSIAM Journal on Computing, 1978
- Deletions That Preserve RandomnessIEEE Transactions on Software Engineering, 1977
- Random insertion into a priority queue structureIEEE Transactions on Software Engineering, 1975