Sorting with minimum data movement (preliminary draft)

  • J. Ian Munro
  • Venkatesh Raman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)


In this paper, we ask whether one can sort a list of n elements using constant extra space and O(n lg n) comparisons, but only a linear number of data movements. We develop an in-place algorithm that sorts n distinct elements using linear data movements and making O(n lg n) comparisons on the average. We also improve on the existing worst case algorithms that make linear data movements. We present a family of in-place sorting algorithms, that lie between selection sort and heapsort, culminating in one that makes, in the worst case, linear data movements and O(n1+ε) comparisons for any fixed constant ε satisfying 0<ε<1. When O(n) extra space for pointers is available, we give an algorithm that sorts n elements using linear data movements and O(n lg n) comparisons in the worst case.


Data Movement Linear Move Sorting Algorithm Sample Element Extra Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aggarwal, B. Alpern, A. Chandra and M. Snir, A Model for Hierarchical Memory, Proceedings of the 19th STOC, New York, May 1987, pp 305–314.Google Scholar
  2. [2]
    W. D. Frazer and A. C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, JACM 17 (3), 1970 pp 496–507.CrossRefGoogle Scholar
  3. [3]
    E. H. Friend, Sorting on Electronic Computers, JACM 3 (2), 1956 pp 134–168.CrossRefGoogle Scholar
  4. [4]
    D. E. Knuth, The Art of Computer Programming. Volume III: Sorting and Searching Addison-Wesley, 1973.Google Scholar
  5. [5]
    D. E. Knuth, Mathematical Analysis of Algorithms in Proceedings, I.F.I.P. Congress, pp 19–27, ed. C.V. Frieman, North-Holland, Amsterdam (1972)Google Scholar
  6. [6]
    M. A. Kronrod, Optimal Ordering Algorithm without Operational Field, Soviet Math.Dokl. 10, 1969 pp 744–746.Google Scholar
  7. [7]
    J. I. Munro, V. Raman and J. S. Salowe, Stable In Situ Sorting and Minimum Data Movement, manuscript.Google Scholar
  8. [8]
    L. J. Slater, Generalized Hypergeometric Functions, Cambridge University Press (1966).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • J. Ian Munro
    • 1
  • Venkatesh Raman
    • 1
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterloo

Personalised recommendations