binarySearchArray.js

// Given a sorted array of integers, find the index of a target value using a binary search algorithm.

// A binary search finds an item in a sorted array by repeatedly choosing a middle value and dividing the search interval in half. The initial interval includes the whole array. If the value of the target value is less than the middle value of the interval, then the next interval will be the lower half of the current interval. If the value of the target value is greater than the middle value, then the next interval will be the upper half. The search process repeats until the middle value is equal to the target value, or the search interval is empty.


// Note:
// Your function should return -1 for target values not in the array.

function binarySearch (array, target) {
  function innerSearch(min, max){
    var searchIndex = Math.floor((max + min) / 2) | 0;
    console.log(searchIndex)
      if(array[searchIndex] === target){
        return searchIndex;
      }
      else if(target > array[array.length - 1] || target < array[0]){
        return -1;
      }
    if(array[searchIndex] < target){
      searchIndex = Math.ceil((max + min) / 2);
      return innerSearch(searchIndex, max);
    }
    else{
      searchIndex = Math.floor((max + min) / 2);
      return innerSearch(min, searchIndex);
    }
  }
  return innerSearch(0, array.length - 1)
}