Problemadvanced
Minimum-size sorting network
Also called optimal-size sorting network.
Find a sorting network on n inputs with the fewest comparators.
Find a sorting network on n inputs with the fewest comparators.
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 Z5Q77D Edit this page History Report an error