Theoremadvanced
Permuting lower bound
Also called Aggarwal-Vitter permuting bound.
Permuting N items in the external memory model needs Θ(min{N, (N/B) log_{M/B}(N/B)}) I/Os.
Permuting N items in the external memory model needs Θ(min{N, (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 9JY1JB Edit this page History Report an error