An in-place sorting with O(nlog n) comparisons and O(n) moves.

We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(nlog n) element comparisons and O(n) element transports.This solves a long-standing open problem, stated explicitly, for example, in Munro and Raman [1992], of whether there exists a so...

Full description

Bibliographic Details

Published in:	Journal of the ACM 52, 4 (2005).
Main Author:	Franceschini, Gianni
Format:	Article
Language:	English
Subjects:	Theory of computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Sorting and searching. Algorithms. Sorting in place.