Big Omega

The notation Ω(n) is the formal way to express the lower bound of an algorithm's running time. It measures the best case time complexity or the best amount of time an algorithm can possibly take to complete.

If $$f(n) >= C.g(n)$$ for $$n >= n0, c > 0, n > 1$$ then

$$ f(n) = Omega(g(n))

$$