Problemintro
Parallel sorting problem
Also called parallel sort.
Sort n keys using many processors, minimizing parallel time and total work.
Sort n keys using many processors, minimizing parallel time and total work.
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 7MNFD9 Edit this page History Report an error