problem2.cpp

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int n=nums.size();
        int low=0, high=n-1;

        while(low<=high)
        {
            int mid=low+(high-low)/2;
            
            if(target==nums[mid])
                return mid;
            if(nums[low]<=nums[mid])
            {
                if(target>=nums[low] and target<=nums[mid])
                    high=mid-1;
                else 
                    low=mid+1;
            }
            else
            {
                if(target>=nums[mid] and target<=nums[high])
                    low=mid+1;
                else
                    high=mid-1;
            }
                
        }
        return -1;
    }
};