Binary Search

binary_search.js

function binarySearch(nums, target) {
  let start = 0;
  let end = nums.length - 1;
  let p;
  
  while(start <= end) {
    p = Math.floor((start + end) / 2);
    
    if(nums[p] === target) {
      return p;
    } else {
      if(target < nums[p]){
        end = p - 1;
      } else if (target > nums[p]) {
        start = p + 1;
      }
    }
  }
  
  return -1;
}

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