Search in Rotated Sorted Array

public class Solution {
    public int search(int[] A, int target) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(A == null)
            return -1;
        int left = 0;
        int right = A.length - 1;
        while(left <= right)
        {
            int mid = (left + right) / 2;
            if(A[mid] == target)
                return mid;
            if(A[left] <= A[mid])
            {
                if(target < A[mid] && target >= A[left])
                    right = mid - 1;
                else
                    left = mid + 1;
            }
            else
            {
                if(target > A[mid] && target <= A[right]){
                    left = mid + 1;
                }
                else
                {
                    right = mid - 1;
                }
            }
        }
        return -1;
    }
}