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

  while(leftIdx <= rightIdx){
    const middleIdx = Math.floor((leftIdx + rightIdx)/2);

    if(numbers[middleIdx] === target) return middleIdx;

    if(numbers[middleIdx] < target) leftIdx = middleIdx + 1
    else rightIdx = middleIdx - 1;
  }
  

  return -1;
}

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