A fast sorting algorithm, a hybrid of distributive and merge sorting
- 18 April 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 10 (3) , 163-167
- https://doi.org/10.1016/0020-0190(80)90069-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The practical significance of distributive partitioning sortInformation Processing Letters, 1979
- A Fast Merging AlgorithmJournal of the ACM, 1979
- The practical significance of D.P. sort revisitedInformation Processing Letters, 1979
- A Counting Approach to Lower Bounds for Selection ProblemsJournal of the ACM, 1979
- Binary merging by partitioningInformation Processing Letters, 1979
- Implementing Quicksort programsCommunications of the ACM, 1978
- Minimean Merging and Sorting: An AlgorithmSIAM Journal on Computing, 1978
- Sorting by distributive partitioningInformation Processing Letters, 1978
- Expected time bounds for selectionCommunications of the ACM, 1975
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered SetsSIAM Journal on Computing, 1972