logarithmic time

RU: логарифмическое время

A time complexity class O(log n) where each step reduces the remaining problem size by a constant factor — typically halving it. Binary search on a sorted array of one million elements requires at most about 20 comparisons because log₂(1 000 000) ≈ 20.