function binarySearch(numbers: number[], target: number): number {
  let left = 0, right = numbers.length - 1;
  while (left <= right) {
    const middle = (left + right) >> 1;
    if (numbers[middle] === target) return middle;
    if (numbers[middle] < target) left = middle + 1;
    else right = middle - 1;
  }
  return -1;
}

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