Binary searching through an array

Binary Search

Array.prototype.binarySearch = function(find, comparator) {
    var low = 0, high = this.length - 1,
        i, comparison;
    while (low <= high) {
        i = Math.floor((low + high) / 2);
        comparison = comparator(this[i], find);
        if (comparison < 0) { low = i + 1; continue; };
        if (comparison > 0) { high = i - 1; continue; };
        return i;
    }
    return null;
};

//USAGE--------------------------------------------------------
//searchValue is the value you want to find in the sorted array
//Array1 is the array you want to search through
//below will return the position in the array the search first finds a value for

Array1.binarySearch(searchValue, function (search, value) {
  if (search < value) {
      return -1
  } else if (search > value) {
      return 1
  } else {
      return 0;
  }
})