Complexity Analysis, continued
Asymptotic measures:
- Focus on upper bounds.
“The running time is no worse than ..."
- Ignore finite number of exceptions.
"For all inputs at least as large as N, the running time is no worse than ..."
- Focus on growth rates. Ignore coefficients and low-order terms.
"For all inputs at least as large as N, the running time to sort n values is no worse than k * n2, for some k > 0.”
- This is written as
"Time to sort n values is O(n2)."