Which fix removes the subtle bug?
function binarySearch(a, t) {
let lo = 0, hi = a.length;
while (lo < hi) {
const mid = (lo + hi) >> 1;
if (a[mid] === t) return mid;
if (a[mid] < t) lo = mid;
else hi = mid;
}
return -1;
}
- Change
hi = a.lengthtoa.length - 1 - Change
lo = midtolo = mid + 1 - Change
lo < hitolo <= hi - Change
>> 1to/ 2
Without
Play Problem Solving ▸
mid + 1, lo can stall and loop forever.