Sorting on Electronic Computer Systems
Journal of the ACM (JACM)
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
An empirical study of minimal storage sorting
Communications of the ACM
Transferable FORTRAN Subroutine for Rapid Extended Sorting
IEEE Transactions on Computers
An efficient implementation of the Min-Min heuristic
Computers and Operations Research
| Hi-index | 0.02 |
This note describes a new technique—Radix Exchange—for sorting data internal to the high speed memory of an electronic binary digital computer. The technique is faster than Inserting by the ratio (log2n)/n for sorting n = 2c items with values distributed evenly in the range 0 to 2c — 1. Its speed compares favorably with internal merging and it has the significant advantage of requiring essentially no working area in addition to that storage for the data being sorted and the instructions comprising the Radix Exchange routine itself. The nomenclature used is, in most cases, that of E. H. Friend [1].