Thumbnail
Access Restriction
Subscribed

Author Frank, R. M. ♦ Lazarus, R. B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract 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.
Description Affiliation: Los Alamos Scientific Lab, Los Alamos, NM (Frank, R. M.; Lazarus, R. B.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 3
Issue Number 1
Page Count 3
Starting Page 20
Ending Page 22


Open content in new tab

   Open content in new tab
Source: ACM Digital Library