Theoremadvanced
External sorting I/O lower bound
Also called Aggarwal-Vitter sorting bound, External sorting lower bound, I/O sorting lower bound.
Sorting N items in external memory needs Theta((N/B) log_{M/B}(N/B)) I/Os.
Sorting N items in external memory needs Theta((N/B) log_{M/B}(N/B)) I/Os.
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 A636EJ Edit this page History Report an error