Lower Bound
← Back to Big-Omega Notation
A function f(n) is Omega(g(n)) if f(n) grows at least as fast as g(n) for sufficiently large n. The lower bound provides a floor on growth rate, establishing that no input can cause the algorithm to run faster than this rate asymptotically.