function binarySearch(numbers: number[], target: number): number {
  let start = 0;
  let end = numbers.length - 1;
  while (start <= end) {
    const mid = Math.trunc((start + end) / 2);
    if (numbers[mid] === target) return mid;
    if (numbers[mid] > target) {
      end = mid - 1;
    } else {
      start = mid + 1;
    }
  }
  return -1;
}

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