PATTERN 05 · 2 PROBLEMS
Binary search
Search a monotonic decision space by preserving one interval that can still contain the answer.
Start the first lesson ↗MASTER KEYDefine which half is impossible before moving a bound.
0OF 2
RECALLED
RECALLED
Comparing mid with right reveals whether the rotation pivot is at mid or to its left/right.
Not started
↗02Find Minimum in Rotated Sorted Array
Comparing mid with right reveals whether the rotation pivot is at mid or to its left/right.
Not started
↗Search in Rotated Sorted Array
At least one half around mid is normally sorted.