The Pragmatic Programmer

by Andy Hunt

If a simple loop runs from 1 to n, then the algorithm is likely to be O(n)