Problemcore
Unranking of a permutation
Also called permutation from index.
Given an index in 0 to n!-1, construct the permutation at that lexicographic position.
Given an index in 0 to n!-1, construct the permutation at that lexicographic position.
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 8H1DTS Edit this page History Report an error