Search a Rotated Array — Solution & Editorial
Binary search with a twist: at each step one half is sorted (compare a[lo] with a[mid]); decide whether T lies inside that sorted half and recurse accordingly.
Complexity: O(log N)
Binary search with a twist: at each step one half is sorted (compare a[lo] with a[mid]); decide whether T lies inside that sorted half and recurse accordingly.
Complexity: O(log N)