Binary Search
← Back to Searching
Repeatedly divides a sorted collection in half to locate a target value. One of the most efficient search algorithms for sorted data.
Key Properties
Related
- Linear Search (simpler alternative)
- Interpolation Search (variant for uniform data)