 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
The
next step is to learn how to figure out
|
|
|
|
an
algorithm's growth rate.
|
|
|
| • |
We
know how to denote it...and we know
|
|
|
|
what
it means (i.e., usually the worst case)
|
|
|
and
we know how to simplify it (by not
|
|
|
|
including
low order terms or constants)
|
|
|
|
– |
...but
how do we create it?
|
|