Binary Search

search.js

//binary search
var search = function(array, i) {
  var min = 0,
      max = array.length - 1,
      mid = Math.floor((min + max)/ 2);
  while (max >= min) {
    
    if(array[mid] < i) {
      min = mid + 1;
    } else if(array[mid] > i) {
      max = mid - 1;
    } else {
      return mid;
    }

    mid = Math.floor((min + max)/ 2);
  }
  return -1;
}