Big-O in practice: when the constant wins
For inputs under a few dozen elements, insertion sort beats merge sort on every machine we tried. The asymptotic class tells you how cost grows, not which algorithm is faster at the size you actually have.
Measure at the real input size before replacing a simple loop with something clever.