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 such that
0 f(n) c*g(n) for all }

See Figure 3.1b, page 43, for graphical depiction of O.

**Examples:**

- - 2n = O()
- 200 - 100n = O() = O() = ...
- n = O()
- Does f(n) = imply f(n) = O(g(n))? Yes
- Does f(n) = O(g(n)) imply f(n) = ? No