SearchInserted.js

function searchInsert(nums, target) {
  for (let i = 0; i < nums.length; i++) {
    if (nums[i] >= target) {
      //checks the value of current index in array is equal to target
      return i;
    }
  }
  return nums.length;
}
//console.log(searchInsert([1, 3, 5, 6], [5]));

//idea is to find index of target value in sorted array
// so iterate through sorted array  and compare the value at each index  to the target value

// If the target is larger than all the values in the array, the loop exits, and the function returns
// the length of the array, which is the index where the target should be inserted.

//let me use merge sort
function searchInsertByBinarySearch(nums, target) {
  if (nums <= 1) return nums;
  let left = 0;
  let right = nums.length - 1;

  while (left <= right) {
    let mid = Math.floor((left + right) / 2); //position of middle
  
     let value =nums[mid] // middle element
    //  console.log(value,'test')
    if (value === target) {  
      //if value is equal to target return position of  middle element
      return mid;

    } else if (value < target) {
      left = mid + 1;
    } else if (value > target) {
       right = mid - 1;
    }
  }
  return -1
}

console.log(searchInsertByBinarySearch( [5, 10, 15, 20, 25], [15]))