# Defining Efficiency

What does it mean to be efficient? Our ultimate answer will be that an algorithm is efficient if its worst-case running time on input size $n$ is $O(n^d)$ for some constant $d$. But it will take us several steps to build up to that definition.