Algorithm Efficiency

Definition: Algorithm Efficiency

An algorithm is efficient if its Time Complexity $T(n)$ is on the order of $O(n^c)$ for some constant $c$, i.e. there is a polynomial $p(n)$ of degree $c$ such that $T(n)\le p(n)$.