Search Insert Position

Description

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 0

Solution(javascript)

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
const searchInsert = (nums, target) => {
  const aux = (low, high) => {
    if (low > high) {
      return low
    }
    const middle = Math.floor((low + high) / 2)
    if (target === nums[middle]) {
      return middle
    } if (target > nums[middle]) {
      return aux(middle + 1, high)
    }
    return aux(low, middle - 1)
  }
  return aux(0, nums.length - 1)
}