A high-speed sorting procedure
Communications of the ACM
A lower bound on the size of shellsort networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
An empirical study of minimal storage sorting
Communications of the ACM
A method of comparing the time requirements of sorting methods
Communications of the ACM
A guided bibliography to sorting
IBM Systems Journal
Hi-index | 48.25 |
In a recent note1, D. L. Shell has described a high-speed sorting procedure for lists contained in internal memory. The method has the great virtues of requiring no additional memory space and being considerably faster than other such methods, which require a time proportional to the square of the list length. The present authors have studied the statistics of Shell's method and have found a minor modification which increases its speed still further.