LeetCode Search in Rotated Sorted Array

int search(int A[], int n, int target){
	
	int first=0, end=n;
	while(first < end){
		int middle = (first+end)/2;
		if(A[middle] == target){
			return middle;
		}
		if(A[first] <= A[middle]){
			if(target >= A[first] && target < A[middle]){
				end = middle;
			}else{
				first = middle+1;
			}
		}else{
			if(target > A[middle] && target <= A[end-1]){
				first = middle+1;
			}else{
				end = middle;
			}
		}
	}
	return -1;
}