Theoremintro
Sorted search lower bound
Also called search lower bound in sorted array, binary search optimality.
Searching a sorted array of n items by comparisons needs ceil(log2(n+1)) probes; binary search is optimal.
Searching a sorted array of n items by comparisons needs ceil(log2(n+1)) probes; binary search is optimal.
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 KV7YMA Edit this page History Report an error