next up previous
Next: Summary Up: CSE 2320: Algorithms and Previous: Theorem 2.1

Asymptotic Notation in Equations

Example: 2n2 + 3n + 1 = 2n2 + $\Theta(n)$



In other words, there is some function f(n) element of $\Theta(n)$that makes the equation true; namely, 3n + 1.



2n2 + 3n + 1 = 2n2 + $\Theta(n)$ = $\Theta(n^2)$.



In other words, for any function f(n) element of $\Theta(n)$, there is some function h(n) element of $\Theta(n^2)$; namely, 2n2 + f(n).



Copyright © 1998 The University of Texas at Arlington