Overview Big O notation The "Big-On" notation describes the asymptotic behavior of a function. Computer scientists use it to define the complexity of an algorithm. It responds to the question "How quickly does the running time of a program grow relative to the input? There are some basics rules: 1. constants are dropped 2. higher order dominate, lower orders are dropped Some examples: 1. O(1) constant time void Print Number(int number) cout