البحث الثنائي

1function binarySearch(nums, target) {2  let lo = 0, hi = nums.length - 1;3  while (lo <= hi) {4    const mid = Math.floor((lo + hi) / 2);5    if (nums[mid] === target) return mid;6    if (nums[mid] < target) lo = mid + 1;7    else hi = mid - 1;8  }9  return -1;10}