function binarySearch(numbers: number[], target: number): number {
  let lowest = 0;
  let highest = numbers.length - 1;

  while(lowest <= highest) {
    let mid = Math.floor((lowest + highest) / 2);

    if(numbers[mid] === target) {
      return mid;
    }

    if(numbers[mid] < target){
      lowest = mid + 1
    } else {
      highest = mid - 1
    }
  }
  

  return -1;
}

// No modificar: necesario para evaluar el resultado.
export { binarySearch };