Thumbnail
Access Restriction
Subscribed

Author Flores, Ivan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1960
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract For each item to be sorted by address calculation, a location in the file is determined by a linear formula. It is placed there if the location is empty. If there is an item at the specified location, a search is made to find the closest empty space to this spot. The item at the specified location, together with adjacent items, is moved by a process similar to musical chairs, so that the item to be filed can be entered in its proper order in the file. A generalized flowchart for computer address calculation sorting is presented here. A mathematical analysis using average expectation follows. Formulas are derived to determine the number of computer operations required. Further formulas are derived which determine the time required for an address calculation sort in terms of specific computer orders. Several examples are given. A sorting problem solved elsewhere in the literature by an empirical method is solved by the formulas developed here to demonstrate their practical application.
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 1960-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 7
Issue Number 4
Page Count 21
Starting Page 389
Ending Page 409


Open content in new tab

   Open content in new tab
Source: ACM Digital Library