What is big O notation?

What is big O notation?

Approach: Define asymptotic upper bound.

f(n) = O(g(n)) if ∃ c>0, n_0 such that 0 ≤ f(n) ≤ c g(n) for all n ≥ n_0. Describes upper bound on growth rate.

Follow-up: What is big Theta?

Key concepts: asymptotic analysis, upper bound, worst case.