Sorting in linear expected time
- 1 September 1985
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 25 (3) , 451-465
- https://doi.org/10.1007/bf01935365
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Usort: An efficient hybrid of Distributive Partitioning SortingBIT Numerical Mathematics, 1982
- Average time behavior of distributive sorting algorithmsComputing, 1981
- The design and analysis of a new hybrid sorting algorithmInformation Processing Letters, 1980
- A fast sorting algorithm, a hybrid of distributive and merge sortingInformation Processing Letters, 1980
- Implementing Quicksort programsCommunications of the ACM, 1978
- Sorting by distributive partitioningInformation Processing Letters, 1978
- Some performance tests of “quicksort” and descendantsCommunications of the ACM, 1974
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- Algorithm 64: QuicksortCommunications of the ACM, 1961