1 citations · 1 across the 4 of their papers we have counts for
1 paper · 2 filters
Gianni Franceschini, Viliam Geffert
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 so…