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

console.log(searchInsert([1, 3, 5, 6], 5));

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
 var searchInsert = function(nums, target) {
    const arrLength = nums.length;
    let a = 0;
    
    for ( let i = 0; i < arrLength; i++ ) {
        if ( i === arrLength-1 && nums[i] !== target) a = i +1
        if (nums[i] == target || nums[i] > target) {
            return a = i
        }

    }
    return a
};