Big O (Definition)
Suppose f and g are non-negative functions on the domain of natural numbers N = {0, 1, ... }
Then f(n) is said to be O(g(n)) if and only if
there exists a constant c > 0 such that for all but a finite number of values of n, we have f(n) ? c g(n)