User:A007u/sandbox1

Introduction
Recently, Franceschini and Geffert [FOCS 2003] presented an unstable sorting algorithm that matches the asymptotic lower bounds on all computational resources. There has been a long standing question of whether it is possible to sort a sequence of n elements stably (i.e. preserving the original relative order of the equal elements), using O(1) auxiliary space and performing O(n log n) comparisons and O(n) data moves. Munro and Raman stated this problem in [J. Algorithms, 13, 1992] and gave an in-place but unstable sorting algorithm that performs O(n) data moves and O(n 1 + ε ) comparisons.