next up previous
Next: Example: Up: CSE 2320: Algorithms and Previous: Growth of Functions


f(n) = $\Theta(g(n))$, g(n) is the Asymptotically Tight Bound for f(n)

$\Theta(g(n))$ = {f(n): there exist positive constants c1, c2, and n0 such that
$0 \leq c_1g(n) \leq f(n) \leq c_2g(n)$ for all $n \geq n_0$ }

``f(n) = $\Theta(g(n))$'' means f(n) is an element of the set of functions g(n).

Here is a graphical depiction of $\Theta$.

Copyright © 1998 The University of Texas at Arlington