35. Search Insert Position

class Solution {
public:
    int binarySearch(vector<int>& nums,int low,int high,int target){
        if(high>=low){
            int mid=low+(high-low)/2;
            if(nums[mid]==target)
                return mid;
            else if(nums[mid]>target)
                return binarySearch(nums,low,mid-1,target);
            else
                return binarySearch(nums,mid+1,high,target);
        }
        return low;
    }
    int searchInsert(vector<int>& nums, int target) {
        if(nums.size()==NULL)
            return 0;
        return binarySearch(nums,0,nums.size()-1,target);
    }
};