Find target in an ascending array that was rotated at an unknown pivot, in O(log n). Three approaches, same problem — switch between them and watch how each step halves (or scans) the search space.
O(log n)