Thumbnail
Access Restriction
Subscribed

Author Hildebrandt, Paul ♦ Isbitz, Harold
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1959
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract 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 $(log2\textit{n})/\textit{n}$ for sorting $\textit{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].
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1959-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 6
Issue Number 2
Page Count 8
Starting Page 156
Ending Page 163


Open content in new tab

   Open content in new tab
Source: ACM Digital Library