growth rate

RU: скорость роста

The asymptotic rate at which an algorithm's resource cost (time or space) increases as input size n grows, ignoring constant factors. Common classes ordered by growth rate: O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2ⁿ) < O(n!). Growth rate is the central concern of asymptotic complexity analysis.