Counting Operations with Big-O
From constant to quadratic in plain terms.
Why Count Operations
In contests, speed wins. Instead of timing your code, you estimate how many steps it takes. That estimate is its time complexity. 🚀
Meet Big-O
Big-O describes how the operation count grows as the input size n grows. It ignores small details and focuses on the dominant trend.
All lessons in this course
- Counting Operations with Big-O
- The 10^8 Rule of Thumb
- Read Constraints, Pick Complexity
- Why TLE Happens and How to Spot It