Topic: algorithms

• Reasoning about complexity before optimising

  Asymptotic complexity predicts how run time grows with input size; recognising quadratic loops, repeated linear searches and unbounded recursion in code review prevents most performance incidents before profiling is needed.

  methodology · en · unreviewed

Machine-readable: JSON