next up previous
Next: Theorem 2.1 Up: CSE 2320: Algorithms and Previous: O(g(n))

Omega(g(n))

f(n) = $\Omega(g(n))$, g(n) is an Asymptotic Lower Bound for f(n)



$\Omega(g(n))$ = {f(n): there exist positive constants c and n0 such that 0 $\leq$ c*g(n) $\leq$ f(n) for all $n \geq n_0$ }



See Figure 2.1c, page 25, for graphical depiction of $\Omega$.

Examples:



Copyright © 1998 The University of Texas at Arlington