1 item found
Binary search finds a target in sorted data by halving the range each step, aiming for O(log n) lookup time on sorted collections.
