Big O Notation

Big O Notation describes, how well an algorithm scales with the input size. It is used to describe the worst case scenario of an algorithm. It is used to compare algorithms and to determine which algorithm is better.

Visit the following resources to learn more:

• Big O Notation — Calculating Time Complexity
• Big O Notations
• moviesCS 61B Lecture 19: Asymptotic Analysis
• Big Oh Notation (and Omega and Theta)