Leetcode: Searching an Element in a Rotated Sorted Array I

class Solution {public:    int search(int A[], int n, int target) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int start=0;        int end=n-1;                while(start<=end){            int mid=(start+end)/2;            if(A[mid]==target)                return mid;            if(A[start]<=A[mid]){                if(A[start]<=target&&target<A[mid]){                    end=mid-1;                } else start=mid+1;                                } else {                if(A[mid]<target&&target<=A[end])                    start=mid+1;                else end=mid-1;            }        }                return -1;    }};