Theoremadvanced
I/O lower bound for sorting
Also called Aggarwal-Vitter sorting bound, sort(N) lower bound.
Sorting N records with memory M and block size B needs Theta((N/B) log_{M/B}(N/B)) block transfers in the worst case.
Sorting N records with memory M and block size B needs Theta((N/B) log_{M/B}(N/B)) block transfers in the worst case.
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 0YP0ZM Edit this page History Report an error