As a function of \(n\), what is the runtime of the “worst” input?

• pros: very strong guarantee
• cons: too strong of an upper bound, may have better algorithm for Beyond Worst-Case Analysis