Binary search to find the target value in a sorted array.

binarySearch.js

function binarySearch(nums, target) {
  let left = 0;
  let right = nums.length - 1
  
  while (left <= right) {
    let mid = ~~((left + right)/2)
    if (nums[mid] === target) return mid
    if (nums[mid] < target) left = mid + 1
    if (target < nums[mid]) right = mid - 1
  }
  return -1
}

console.log(binarySearch([0,2,3,4,5,6,7,8], 6)) // Output: 5