function binarySearch(numbers: number[], target: number): number {
  let left = 0
  let right = numbers.length - 1

  while (left <= right) {
     const mid = left + Math.floor((right - left) / 2)
     if (numbers[mid] === target) return mid;
     if (numbers[mid] > target) right = mid - 1
     else left = mid + 1
  }
  
  return -1;
}

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