1
var searchInsert = function (nums, target) {
2
  let start = 0;
3
  let end = nums.length - 1;
4

5
  while (start <= end) {
6
    const mid = Math.trunc((start + end) / 2);
7
    if (nums[mid] === target) {
8
      return mid;
9
    }
10
    if (nums[mid] < target) {
11
      start = mid + 1;
12
    } else {
13
      end = mid - 1;
14
    }
15
    if (nums[end] < target) {
16
      return end + 1;
17
    }
18

19
    if (nums[start] > target) {
20
      return start;
21
    }
22
  }
23
};