April 24, 2020

Is there a computer science topic more terrifying than Big O notation? Don’t let the name scare you, Big O notation is not a big deal. It’s very easy to understand and you don’t need to be a math whiz to do so. In this series, you’ll learn the fundamentals of Big O notation with examples in JavaScript.

The following list is a ‘table of contents’ of my articles about Big O. They weren’t all written in this order, but this is the order I recommend reading them in. If you think otherwise or think there’s something missing, let me know on Twitter @jarednielsen. And there’s more on the way! If you want to stay in the loop, sign up for my newsletter, The Solution.

- What is Big O Notation?
- Big O Linear Time Complexity
- How to Sum Consecutive Integers 1 to n
- Big O Quadratic Time Complexity
- Big O Logarithmic Time Complexity
- Proof by Induction
- How to Sum Consecutive Powers of 2
- Big O Time and Space Complexity? [⏳ Coming soon!]
- Big O Recursive Time Complexity
- Big O Recursive Space Complexity
- Dynamic Programming: Memoization and Tabulation
- Big O Log-Linear Time Complexity
- Big O Amortized Analysis [⏳ Coming soon!]
- How to Calculate Permutations and Combinations
- Big O Factorial Time Complexity
- What’s the Difference Between Big O, Big Omega, and Big Theta?

Want to level up your problem solving skills? I write a weekly newsletter about programming, problem solving and lifelong learning. Join now