Two levels are as good as any
- 31 March 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (1), 138-144
- https://doi.org/10.1016/0196-6774(85)90024-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Analysis of n-treesInformation Processing Letters, 1983
- Usort: An efficient hybrid of Distributive Partitioning SortingBIT Numerical Mathematics, 1982
- On the average-case complexity of “bucketing” algorithmsJournal of Algorithms, 1982
- Searching and sorting real numbersJournal of Algorithms, 1981
- Average time behavior of distributive sorting algorithmsComputing, 1981
- The design and analysis of a new hybrid sorting algorithmInformation Processing Letters, 1980
- Complexity of sorting by distributive partitioningInformation Processing Letters, 1979
- The practical significance of distributive partitioning sortInformation Processing Letters, 1979
- The practical significance of D.P. sort revisitedInformation Processing Letters, 1979
- Sorting by distributive partitioningInformation Processing Letters, 1978