O(log n) time

RU: O(log n) время

Time complexity where each step halves (or reduces by a constant factor) the remaining problem size. Achieves logarithmic speedup compared to linear scan. Example: binary search on a sorted array of one million elements requires at most log₂(1,000,000) ≈ 20 comparisons.