Binary Search Visualization

Efficiently finds an element in a sorted array by repeatedly dividing the search interval in half.

Ready to search

Speed

1function binarySearch(arr, target)

2 left = 0, right = n - 1

3 while left <= right

4 mid = left + (right - left) / 2

5 if arr[mid] == target

6 return mid

7 if arr[mid] < target

8 left = mid + 1

9 else

10 right = mid - 1

11 return -1

Best CaseO(1)

Average CaseO(log n)

Worst CaseO(log n)