Internal Sorting by Radix Plus Sifting

Authors:
M. Donald MacLaren
Affiliations:
Argonne National Laboratory, Argonne, Illinois
Venue:
Journal of the ACM (JACM)
Year:
1966

Citing 1
Cited 7

Sorting on Electronic Computer Systems

Journal of the ACM (JACM)

Sorting

ACM Computing Surveys (CSUR)
Best sorting algorithm for nearly sorted lists

Communications of the ACM
Computing joins of relations

SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Acceleration of Nonnumeric Operations Using Hardware Support for the Ordered Table Hashing Algorithms

IEEE Transactions on Computers
A linear probing sort and its analysis(Preliminary Draft)

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Probabilistic integer sorting

Information Processing Letters
A guided bibliography to sorting

IBM Systems Journal

Quantified Score

Hi-index	0.02

Visualization

Abstract

A method is proposed for internal sorting which has the property that the expected time required per record, to sort n records with random keys, is a bounded function of n. Moreover the storage required in addition to that for the records is only 2n address fields. It appears that the method may be a good choice when the number of records to be sorted is of the order of 10,000 or more.The method consists of partially sorting the records by a radix sort and completing the sort by sifting. In the radix sort, a list type of structure is used to present the distribution of the records.