BinarySearch(二元搜尋)

function binarySearch(array, target) {
  let min = 0;
  let max = array.length - 1;
  let step = 0
  while (min <= max) {
    const middle = Math.floor((max + min) / 2);
    step ++
    if (target > array[middle]) {
      min = middle + 1;
    } else if (target < array[middle]) {
      max = middle - 1;
    } else {
      console.log("Find target number " + target + " at position " + middle);
      console.log("using " + step + " steps to find ");

      return middle;
    }
  }
  console.log("Can't find target number " + target);
  return -1;
}