Research and Advances

An estimation of the relative efficiency of two internal sorting methods


This report concerns the IBM 705, models I and II. It is a study of the machine time required by two internal sorting methods, the conventional two-way merge, and a form of the binary search, which is due to D. Mordy, of the IBM Corporation. In particular, estimates are derived for the more time-consuming machine operations of comparison of keys, loading of keys into accumulator storage, and transmission of tags. The first two operations arise in both methods; the last is peculiar to the binary search. If the exclusion of other ancillary program steps from the estimation of machine times may be regretted from a purely practical point of view, some of the intermediate estimates may be of interest in a more theoretical context.

View this article in the ACM Digital Library.

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More