binary_search_insert

binary_search_insert.js

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var searchInsert = function(nums, target) {
    
    let start = 0
    let end = nums.length - 1
    if (nums[end] < target) {
        return end + 1
    }
    
    let mid = (start + end) >> 1
    while (start < end) {
            
        let midVal = nums[mid]
        
        if (midVal === target) {
            return mid // mid + 1 if insert after
        } else if (midVal < target) {
            start = mid + 1
        } else {
            end = mid
        }

        mid = (start + end) >> 1
    }
    
    return mid
    
};