Big Omega Notation - Best case - Used rarely

Just as Big O notation provides an asymptotic lower bound on a function, Ω notation provides an asymptotic lower bound.

Ω Notation< can be useful when we have lower bound on time complexity of an algorithm. As discussed in the previous post, the best case performance of an algorithm is generally not useful, the Omega notation is the least used notation among all three.

f(n) >= c * g(n), n >= n0, n0>=1 , c>0

example:

f(n) = Ω g(n) where

f(n) = 3n+2, g(n) = n

3n+2 >= c * n

so for c=1 and n0>=1 its true.

f(n) is lower bounded by log(n), log(log(n)) etc.