Usort: An efficient hybrid of Distributive Partitioning Sorting
- 1 June 1982
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 22 (2), 135-139
- https://doi.org/10.1007/bf01944472
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Average time behavior of distributive sorting algorithmsComputing, 1981
- Selection by distributive partitioningInformation Processing Letters, 1980
- 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
- The practical significance of distributive partitioning sortInformation Processing Letters, 1979
- The practical significance of D.P. sort revisitedInformation Processing Letters, 1979
- Implementing Quicksort programsCommunications of the ACM, 1978
- Some performance tests of “quicksort” and descendantsCommunications of the ACM, 1974