The Pragmatic Programmer

by Andy Hunt

When we write that a particular sort routine sorts n records in O(n2) time, we are simply saying that the worst-case time taken will vary as the square of n.