dsa-competitive-programming/leetcode/lc35.cpp

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

                if(target<nums[mid]){
                    end = mid -1;
                    
                }
                else{
                    start = mid+1;
                }

            }
            return start;
        }
};