Asymptotic Notation
In the previous section, we calculated the exact polynomial execution time of a function, such as $T(n) = 3n + 4$. While mathematically precise, dealing with exact polynomials becomes impossible as software architectures grow to millions of lines of code.