【LeetCode】Search in Rotated Sorted Array

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