Definitionintro
Distribution sort
Also called Distribution-based sorting.
A sort that uses key values to place items directly, escaping the Ω(n log n) comparison lower bound.
A sort that uses key values to place items directly, escaping the Ω(n log n) comparison lower bound.
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 MCFA67 Edit this page History Report an error