Sorting of data on an electronic computer

  title={Sorting of data on an electronic computer},
  author={D. Davies},
  • D. Davies
  • Published 1 April 1956
  • Computer Science
Many methods of sorting can be used in an electronic universal digital computer. Different sorting problems require different processes, not only for efficiency of sorting, but also to preserve such order as already exists in the data. The sorting methods known to the author are described in the paper, and their effectiveness is evaluated in various types of sorting problem.Since the possibility of using many different methods of sorting arose only recently, with the advent of the electronic… 
5 Citations

Topics from this paper

Sorting, Trees, and Measures of Order
  • W. Burge
  • Computer Science, Mathematics
    Inf. Control.
  • 1958
This paper analyses the best methods of sorting on a digital computer using two main types, “sorting by merging” and “distribution sorting”, and a minimal tree is constructed giving the best strategy.
Amphisbaenic Sorting
A method is described, derived from Davies' and requiring p + 1 tape units, which overcomes limitations of the principal methods for sorting data on an electronic digital computer.
Sortierprozesse auf elektronischen Rechenanlagen
The author describes and gives flow charts of the following internal sorting techniques and the problem of an optimal procedure relative to the average number of key comparisons is discussed and one technique is analysed reaching the possible minimum.
Donald Watts Davies, C.B.E. 7 June 1924 – 28 May 2000
  • R. Needham
  • Medicine
    Biographical Memoirs of Fellows of the Royal Society
  • 2002
Donald Davies left a comprehensive note of his career, in a delightful and very personal style, and it would be a poor service to his memory to do other than quote from it extensively. His friends