Theoremadvanced
Merging lower bound
Also called Hwang-Lin merging bound, merging sorted lists lower bound.
Merging sorted lists of sizes m and n needs about log2 C(m+n, n) comparisons in the worst case.
Merging sorted lists of sizes m and n needs about log2 C(m+n, n) comparisons 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 90H3JS Edit this page History Report an error