Running Time and Asymptotic Notation

Asymptotic Growth

Analyze how an algorithm performs for very large input sizes.

Good job! That's it for "Asymptotic Growth."

Need a second look? Watch again

Running Time and Asymptotic Notation

Asymptotic Growth

There are some estimating shortcuts we can take for analyzing algorithms. If the size of the input (think size of an array) is large enough (really really large) we can just remove the constants and keep the highest order term. It feels like cheating but it works because the lower order terms and constants end up being completely dominated by the highest order term for large inputs. This video should make it more intuitive!

  • Computer Science
Join the Discussion

Want to leave a comment? .