Math Fundamentals18 sections · 814 units
Open in Course

Binary Search - Algorithm

(Shrinking window)

1.1. Set left = 0, right = arr.length - 1

2.2. While left <= right: compute mid = (left + right) / 2

3.3. If arr[mid] == target, return mid

4.4. If arr[mid] < target, set left = mid + 1

5.5. If arr[mid] > target, set right = mid - 1

6.6. If loop exits, return -1