LeetCode之Search in Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

idea：

if  A[mid] > A[start]   start to mid are sorted

if  A[mid] < A[start]    mid to end are sorted

special case :start to end are sorted/only one element...

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