Algorithmintro
Fisher-Yates shuffle
Also called Knuth shuffle, Durstenfeld shuffle, Fisher-Yates-Knuth shuffle.
Generates a uniform random permutation in place in O(n) time by swapping each position with a uniformly chosen position at or after it.
Generates a uniform random permutation in place in O(n) time by swapping each position with a uniformly chosen position at or after it.
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 NRAJQ8 Edit this page History Report an error