Next:
Asymptotic Notation in Equations
Up:
CSE 2320: Algorithms and
Previous:
Omega(g(n))
Theorem 2.1
f(n) =
if and only if f(n) = O(g(n)) and f(n) =
.
Copyright © 1998 The University of Texas at Arlington