Theoremcore
Bucket sort expected linear time
On independent uniform keys in [0,1), bucket sort with n buckets runs in expected O(n) time.
On independent uniform keys in [0,1), bucket sort with n buckets runs in expected 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 3XZ095 Edit this page History Report an error