Search in Rotated Sorted Array II

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.

Solution:

class Solution {
public:
    bool search(int A[], int n, int target) {
        int left = 0, right = n - 1;
        while(left <= right)
        {
            int mid = (left + right) / 2;
            if(target == A[mid]) 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[mid] && target <= A[right]) left = mid + 1;
                else right = mid - 1;
            }
            else left++;
        }

        return false;
    }
};