next up previous
Next: Omega(g(n)) Up: CSE 2320: Algorithms and Previous: Example:

O(g(n))

f(n) = O(g(n)), g(n) is an Asymptotic Upper Bound for f(n)



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



See Figure 2.1b, page 25, for graphical depiction of O.



Examples:



Copyright © 1998 The University of Texas at Arlington