Asymptotic Notation & Growth

Big-O, Omega, and Theta, tight vs loose bounds, best, average, and worst case, and comparing growth rates.

0 / 5 solved

Question Tags Difficulty Success

1. Eight Times Every Doubling

doubling-hypothesisempirical-analysis +1

Medium 55%

2. Correct But Too Loose

big-otight-bounds +1

Medium 65%

3. The Pointer Never Resets

two-pointersloop-analysis +1

Medium 44%

4. Every True Upper Bound

big-otheta +2

Medium 30%

5. Race At One Million

growth-ratelogarithms +1

Medium 60%

Learning Resources

CMU 15-122, Asymptotic Analysis (Big-O)

MIT 6.006 Lecture 1, Introduction and asymptotics

Algorithms, 4th Edition, Analysis of Algorithms

Up next

5 of 5 questions here are still unsolved.

Next module Recurrences & The Master Theorem