704. Binary Search.cpp

class Solution {
public:
    int search(vector<int>& nums, int target)
    {
        return binarySearch(nums,0,nums.size()-1,target);
    }

    int binarySearch(vector<int> nums,int left,int right,int target)
    {
        if(left<=right)
        {
            int mid = (right+left)/2;
            
            if(target==nums[mid])
            {
                return mid;
            }
            if(target>nums[mid])
            {
                return binarySearch(nums,mid+1,right,target);
            }
            if(target<nums[mid])
            {
                return binarySearch(nums,left,mid-1,target);
            }

        }
        return -1;
    }
};