//if you don't find a pivot, this would mean the array is not rotated. if (pivot == -1) { //just do normal binary search as array is not rotated. return binarySearch ...
This question is just like: Find Minimum in Rotated Sorted Array https://github.com/cherryljr/LintCode/blob/master/Find%20Minimum%20in%20Rotated%20Sorted%20Array.java ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback