Leetcode: Search in Rotated Sorted Array II

class Solution {
public:
// The time complexity is O(N) in worest case
// For example, A[]={1,1,1,1,1,1,1,1,1,1} and target=2
bool search(int A[], int n, int target) {
int left=0, right=n-1;
while(left<=right){
int mid=(left+right)/2;
if(A[mid]==target||A[left]==target) return true;
if(A[left]<A[mid]){
if(target>A[left]&&target<A[mid]) right=mid-1;
else left=mid+1;
}
else if(A[left]>A[mid]){
if(target>A[left]||target<A[mid]) right=mid-1;
else left=mid+1;
}
else left++;
}
return false;
}
};