33. Search in Rotated Sorted Array

link Key ideas If we split the rotated array from the mid, there must be a sorted half and an unsorted half [5, 6, 1, 2, 3, 4] -> [5, 6, 1] (unsorted) + [2, 3, 4] (sorted) [5, 6, 1] -> [5] (sorted) + [6, 1] (unsorted) We can apply regular binary...