[codeflo]

> That and understanding when big O doesn't matter for your problem size.

For example, an extra factor of log(n) is hardly ever relevant, constant factors are almost guaranteed to dominate there.

On the flip side, people are also sometimes surprised to see how quickly an n^3 algorithm becomes infeasible even for very modest data sizes.