Search in Rotated Sorted Array

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