2 docs tagged with "big-o"

Big-O describes an upper bound on growth. Saying an algorithm is $O(n^2)$ claims that beyond some

Measuring an algorithm by timing it tells you about your laptop, your compiler, your input, and the