Big-O notation

RU: нотация Big-O

A mathematical notation that expresses an upper bound on how an algorithm's time or space grows as input size n increases, ignoring constant factors. O(g(n)) means there exist constants c and n₀ such that the cost never exceeds c·g(n) for all n ≥ n₀, capturing the asymptotic upper bound on growth rate.