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
).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
Analysis:
Binary Search
compare A[m]?target & A[m]?A[l]
Java
public int search(int[] A, int target) {
int l = 0;
int len = A.length;
int r = len-1;
while(l<=r){
int m = (l+r)/2;
if(A[m]==target) return m;
if(A[m]>=A[l]){
if(A[l]<=target && target<=A[m])
r = m-1;
else {
l = m+1;
}
}else {
if(target>=A[m]&&target<=A[r])
l = m+1;
else {
r = m-1;
}
}
}
return -1;
}
c++
int search(int A[], int n, int target) {
int l =0, r = n-1;
while(l<=r){
int m = (l+r)/2;
if(A[m] == target) return m;
if(A[m]>= A[l]){
if(A[l]<=target && target<= A[m]) r = m-1;
else l = m+1;
}else{
if(target>=A[l] || target<=A[m]) r = m-1;
else l = m+1;
}
}
return -1;
}