Elsevier

Journal of Algorithms

Volume 13, Issue 3, September 1992, Pages 374-393
Journal of Algorithms

Sorting with minimum data movement

https://doi.org/10.1016/0196-6774(92)90045-EGet rights and content

Abstract

All existing O(n lg n) sorting algorithms perform Ω(n lg n) data movements or use Θ(n) words of extra storage. Here we ask whether one can sort n elements using a constant number of indices and extra data locations, O(n lg n) comparisons and O(n) data movements. We answer the question affirmatively for the average case and present significant improvements to the existing worst case algorithms that make O(n) data movements.

References (23)

  • G.H Gonnet

    The Heap as a Data Structure

  • Cited by (13)

    • Asymptotically efficient in-place merging

      2000, Theoretical Computer Science
    • In-place sorting with fewer moves

      1999, Information Processing Letters
    • In-place sorting

      2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    View all citing articles on Scopus

    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.

    View full text