An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
| dc.creator | Franceschini, Gianni | |
| dc.creator | Geffert, Viliam | |
| dc.date | 2003-05-09 | |
| dc.date.accessioned | 2026-07-07T06:32:46Z | |
| dc.date.available | 2026-07-07T06:32:46Z | |
| dc.description | We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports. This solves a long-standing open problem, stated explicitly, e.g., in [J.I. Munro and V. Raman, Sorting with minimum data movement, J. Algorithms, 13, 374-93, 1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously. | |
| dc.identifier | https://arxiv.org/abs/cs/0305005 | |
| dc.identifier | http://arxiv.org/abs/cs/0305005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/98974 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Computational Complexity | |
| dc.subject | F.2.2 | |
| dc.title | An In-Place Sorting with O(n log n) Comparisons and O(n) Moves | |
| dc.type | text |