asymptotic

RU: асимптотический

Describing how a function behaves as its argument grows toward infinity, ignoring constant factors and low-order terms. In algorithm analysis, asymptotic notation (O, Ω, Θ) characterises growth rate rather than exact step counts, so the same complexity class applies regardless of hardware or implementation constants.