Problemcore
Search in a rotated sorted array
Also called cyclically shifted sorted array search.
Find a key in a sorted array rotated at an unknown pivot in O(log n) time when the values are distinct.
Find a key in a sorted array rotated at an unknown pivot in O(log n) time when the values are distinct.
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 34SK70 Edit this page History Report an error