1,720,998 research outputs found
An in-place sorting with O (n log n) comparisons and O(n) moves
No full textWe 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, 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. © 2005 ACM
9th International Workshop on Descriptional Complexity of Formal Systems : High tatras, Slovakia, July 2o-22 2007 : Proceedings
No full text
Alternating space is closed under complement and other simulations for sublogarithmic space
No full text
- …
