Sorting on Electronic Computer Systems
Journal of the ACM (JACM)
Sorting by Address Calculation
Journal of the ACM (JACM)
A method of vector processing for shared symbolic data
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Addressing for Random-Access Storage with Multiple Bucket Capacities
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Analysis of a file addressing method
Communications of the ACM
Analysis of computational systems: Cumulative polygon address calculation sorting
ACM '65 Proceedings of the 1965 20th national conference
Non-uniform key distribution and address calculation sorting
ACM '66 Proceedings of the 1966 21st national conference
Measurement of computer systems: an introduction
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
| Hi-index | 0.02 |
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.