Problemadvanced
Small order statistics
Finding the i-th smallest element for small i using fewer comparisons than general selection, via tournament style methods.
Finding the i-th smallest element for small i using fewer comparisons than general selection, via tournament style methods.
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 E3GDGT Edit this page History Report an error