function binarySearch(numbers: number[], target: number): number {
  let left = 0
  let rigth = numbers.length - 1  
  let result = -1
  while(left <= rigth){
    let mid = Math.floor((left + rigth) / 2)
    if(numbers[mid] === target) {   
      result = mid
      rigth = mid - 1
    } else if(numbers[mid] < target) {
      left = mid + 1
    } else {
      rigth = mid - 1
    }
  }
  return result
}

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