Binary Search

Repeatedly halves a sorted array, comparing the middle element to the target — O(log n) lookups.

Beginnerdivide & conquersorted requiredO(log n)

Loading visualization…