An in-place sorting with O (n log 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 0 (n log n) element comparisons and 0 (n) element transports. This solves a long-standing open problem, stated explicitly, for example, in Munro and Raman 1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously.
algorithms sorting in-place