Big O notation §

Date created: 2021-11-11

It’s a way to describe the algorithmic worst-case scenario in computer scenario. Three examples:

• Constant (no matter how many n, the time is constant)
• Linear (increases linearly)
• Quadratic O (increases n^2)

---

References §

• Sorting, chapter 3 in Algorithms to live by