We address the problem of quickly inverting the standard representation of a permutation on $n$ elements in place. First, we present a naive algorithm to do it using $O(\log n)$ extra bits in $O(n^2)$ time in the worst ...