Asymptotic computational complexity

In computational complexity theory, asymptotic computational complexity is the use of asymptotic analysis for the estimation of the computational complexity of algorithms and computational problems, commonly associated with the use of the big O notation. == Scope == With respect to computational resources, asymptotic time complexity and asymptotic space complexity of computational algorithms and programs are commonly estimated.

Source: Wikipedia — Asymptotic computational complexity (CC BY-SA 4.0)