Post

✨ Big O ✨ Let me take you on a visual introduction to what big O notation is in my new blog post: samwho.dev/big-o. With big O notation you can better understand how algorithms will perform in practice, finding orders of magnitude improvements often with very simple changes to your code.

nice post! i love the interactive graphs. there are a few things aren't correct here though. this is false. it's a common misconception, but it's still wrong. O and Θ can both be used to describe worst-case or average case complexities.

sorry, but that's still incorrect. Θ(n^2) is not about best case complexity, it means that the complexity of the algorithm is equivalent to n^2, whereas with O, it is only "at most as slow as" n^2, but it could be faster. so bubble sort's worst case complexity *is* in Θ(n^2)