Problemadvanced
Average sorting (k-sorted arrays)
Also called Average sorting.
Sorting an array that is already nearly sorted in the sense that each element lies within k positions of its final place.
Sorting an array that is already nearly sorted in the sense that each element lies within k positions of its final place.
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 652RN0 Edit this page History Report an error