Sorting with minimum data movement

DOI10.1016/0196-6774(92)90045-EMaRDI QIDQ4020351zbMATH OpenOpenAlexFDO

Authors J. Ian Munro, Venkatesh Raman

Publication date 16 January 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90045-e

zbMATH Keywords

average caseworst casedata movements

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 140497
• Stable in situ sorting and minimum data movement
• In-place sorting with fewer moves
• Selection from read-only memory and sorting with minimum data movement
• Optimally sorting evolving data
• Fast stable in-place sorting with \(O(n)\) data moves
• Sorting by bounded block-moves
• Sorting by placement and shift
• Minimum cost sorting problem

Cited in

(10)

• Selection from read-only memory and sorting with minimum data movement
• scientific article; zbMATH DE number 1926670 (Why is no real title available?)
• Sort Me If You Can: How to Sort Dynamic Data
• Asymptotically efficient in-place merging
• Stable in situ sorting and minimum data movement
• In-place sorting with fewer moves
• Electronic Data Sorting
• Asymptotically fastest sorting algorithm for almost sorted arrays
• scientific article; zbMATH DE number 140497 (Why is no real title available?)
• In-place sorting

This page was built for publication: Sorting with minimum data movement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020351)