Conceptintro
Inverse permutation
Also called inverse of a permutation.
The permutation that undoes a given one; computable in O(n) time.
The permutation that undoes a given one; computable in O(n) time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag KXY88Q Edit this page History Report an error