Skip to content

Searching

Problem Complexity Key Pattern
Binary Search O(log n) Sorted array lookup or any monotonic predicate search — "find target",
Find Minimum Rotated O(log n) Pivot finding in a rotated sorted array — "find rotation point",
Search Rotated Array O(log n) Invariant-based binary search — array is sorted but shifted/rotated.