Algorithmintro
Sort-based shuffle
Also called shuffle by random keys, random-key sort shuffle.
Assign each item an independent random key and sort by key; uniform when keys are i.i.d. and ties are negligible, at O(n log n) cost.
Assign each item an independent random key and sort by key; uniform when keys are i.i.d. and ties are negligible, at O(n log n) cost.
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 JTAPRN Edit this page History Report an error