Growth Rates

• O(f(n )) if constants k and n0 exist such that it takes no more than k*f(n) time to solve a problem of size >= n0
• Some algorithms behave strange for small n. The inclusion of n0 in the definition ignores these behaviors.
• Inclusion of k eliminates comparison of negligible algorithm differences.