Problemcore
Peak finding
Also called local maximum finding, 1D peak finding.
Find an index whose value is at least as large as its neighbours, in O(log n) probes.
Find an index whose value is at least as large as its neighbours, in O(log n) probes.
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 9MV358 Edit this page History Report an error