Search in Rotated Sorted Array

Suppose an array sorted in ascending order 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.

Your algorithm's runtime complexity must be in the order of O(log n).

class Solution {
public:
    int search(vector<int>& nums, int target) 
    {
        int n=nums.size(),le=0,ri=n-1;
        if(n==0)
            return -1;
        while(le<=ri)
        {
            int mid=(le+ri)/2;
            if(nums[mid]==target)
                return mid;
            else if(nums[mid]<nums[ri])
            {
                if(target<=nums[ri]&&target>nums[mid])
                    le=mid+1;
                else
                    ri=mid-1;
            }
            else
            {
                if(target>=nums[le]&&target<nums[mid])
                    ri=mid-1;
                else
                    le=mid+1;
            }
        }
        return -1;
    }
};