Search in Rotated Sorted Array

Question:

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.

Solution:

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