Today we will look at a common way algorithms are described, as an upper-bound on their growth functions. These are used to categorize algorithms roughly and can be used as a guide to algorithm selection.