Omega notation

Omega notation represents the lower bound of the running time of an algorithm. It is the base case complexity of an algorithm. ¹

Ω(g(n)) = { f(n): there exist positive constants c and n0 
            such that 0 ≤ cg(n) ≤ f(n) for all n ≥ n0 }