f(n) and g(n): the running times of two algorithm on inputs of size n.
Let f(n) and g(n) be functions from positive integers to positive reals.
f=O(g) (which means that "f grows no faster than g") if there is a constant c > 0 such that f(n)≤c·g(n).
g=Ω(f) means f=O(g)
f=Θ(g) means f=O(g) and g=O(f).