Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). How do you find an element in the rotated array efficiently? You may assume no duplicate exists in the array.Suppose a sorted array is rotated at some p
阅读背景：
Searching an Element in a Rotated Sorted Array
来源：互联网
分享到：
