Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves

DOI10.1007/s00224-006-1311-1zbMath1121.68033OpenAlexW2085844580WikidataQ56066263 ScholiaQ56066263MaRDI QIDQ2643133

Gianni Franceschini

Publication date: 23 August 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-006-1311-1

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time ⋮ In-Place Sorting

This page was built for publication: Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves