Complexity

How to reason about cost — deriving bounds rather than memorising them, and knowing when the constant factor beats the exponent.

• Big-O and ComplexityHow to derive the cost of a program instead of memorising a table — and why an O(n²) algorithm is sometimes the right choice.foundational