# Algorithm - (Performance|Running Time|Fast)

The performance of an algorithm can be assessed through the number of basic operations that it performs as a function of the length of the input numbers.

running time = # of lines of code executed.

$$\text{fast algorithm} \approx \href{case#worst}{\text{worst-­case running}} \text{ grows slowly with input size}$$ Usually want as close to linear (O(n)) as possible.