Let's say that the array sorted in ascending order is rotated at a pre-known point.
(for example, the array [0,1,2,4,5,6,7] may change to [4,5,6,7,0,1,2]).
Search for a given target value. If the target value exists in the array, its index will be returned, otherwise - 1 will be returned.
You can assume that there are no duplicate elements in the array.
The time complexity of...