Week 2: Analysis of Algorithms (8)

Uses high-level description of the algorithm instead of implementation ("pseudocode")
Characterises running time as a function of the input size, n
Takes into account all possible inputs
Allows us to evaluate the speed of an algorithm independent of the hardware/software environment