binary search

RU: бинарный поиск

A search algorithm that operates on a sorted array by repeatedly comparing the target with the middle element and discarding the half that cannot contain the target. Each step halves the remaining search space, giving O(log n) time and O(1) auxiliary space.