Problemadvanced
Minimum-depth sorting network
Also called optimal-depth sorting network.
Find a sorting network on n inputs with the smallest possible depth.
Find a sorting network on n inputs with the smallest possible depth.
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 VFVDV5 Edit this page History Report an error