leetcode_problem_33.cpp

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