Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
[0,1,2,4,5,6,7] might become
You are given a target value to search. If found in the array return its index, otherwise return
You may assume no duplicate exists in the array.
Your algorithm’s runtime complexity must be in the order of O(log n)
HINT : Since we need search time to be O(logn) the obvious hint is to somehow use binary search.