Growth of Functions

Complexity of an Algorithm

Big-$\mathcal{O}$ Notation

Theorem 1: