What is the best known lowerbound for the worst case complexity of in-situ permutation (also called in-place rearrangement)? Has there been any reported progress after the 1970's article by Knuth (which also appears as Chapter 1 of his book "Selected Papers on Analysis of Algorithms")?
Asked
Active
Viewed 221 times
6
-
1related unanswered question: http://cstheory.stackexchange.com/q/6711/1037 – Artem Kaznatcheev Jun 13 '11 at 02:24