Abstract
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(n 1+ε) 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.
Research supported by Natural Sciences and Engineering Research Council of Canada grant No.A-8237 and the Information Technology Research Centre of Ontario
Preview
Unable to display preview. Download preview PDF.
References
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.
W. D. Frazer and A. C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, JACM 17 (3), 1970 pp 496–507.
E. H. Friend, Sorting on Electronic Computers, JACM 3 (2), 1956 pp 134–168.
D. E. Knuth, The Art of Computer Programming. Volume III: Sorting and Searching Addison-Wesley, 1973.
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)
M. A. Kronrod, Optimal Ordering Algorithm without Operational Field, Soviet Math.Dokl. 10, 1969 pp 744–746.
J. I. Munro, V. Raman and J. S. Salowe, Stable In Situ Sorting and Minimum Data Movement, manuscript.
L. J. Slater, Generalized Hypergeometric Functions, Cambridge University Press (1966).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Munro, J.I., Raman, V. (1989). Sorting with minimum data movement (preliminary draft). In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_46
Download citation
DOI: https://doi.org/10.1007/3-540-51542-9_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51542-5
Online ISBN: 978-3-540-48237-6
eBook Packages: Springer Book Archive