Sorting with minimum data movement☆
References (23)
- et al.
Time bounds for selection
J. Comput. System Sci.
(1973) Priority queues with update and finding minimum spanning trees
Inform. Process. Lett.
(1975)An implicit data structure supporting insertion, deletion, and search in O(lg2 n) time
J. Comput. System Sci.
(1980)Worst-case analysis of a generalized heapsort algorithm
Inform. Process. Lett.
(1990)- et al.
A model for hierarchical memory
Recursive samplesort
BIT
(1978)Algorithm 245, Treesort
Comm. ACM
(1964)- et al.
Expected time bounds for selection
Comm. ACM
(1975) - et al.
Samplesort: A sampling approach to minimal storage tree sorting
J. Assoc. Comput. Mach.
(1970) Sorting on electronic computers
J. Assoc. Comput. Mach.
(1956)
The Heap as a Data Structure
Cited by (13)
Asymptotically efficient in-place merging
2000, Theoretical Computer ScienceIn-place sorting with fewer moves
1999, Information Processing LettersSelection from read-only memory and sorting with minimum data movement
1996, Theoretical Computer ScienceIn-place sorting
2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Sorting stably, in place, with O(n log n) comparisons and O(n) moves
2007, Theory of Computing SystemsLinear-time in-place selection with ε · n element moves
2006, Computing and Informatics
- ☆
Some of these results were announced in preliminary form in [15]. This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No. A-8237 and by the Information Technology Research Centre of Ontario.
Copyright © 1992 Published by Elsevier Inc.