Omega notation (Ω)

In a similar way that Big O notation describes the upper bound, Omega notation describes a tight lower bound. The definition is as follows:

The objective is to give the largest rate of growth that is equal to or less than the given algorithms, T(n), rate of growth.