| Algorithm Efficiency |
|
|
|
|
|
|
|
|
|
|
|
|
| • | f(N)
is called the algorithm's growth-rate |
||||||||||
| function. |
|||||||||||
| • | We
call this the BIG O Notation! |
||||||||||
| • | Examples
of the Big O Notation: |
||||||||||
| – | If a
problem requires a constant time that is |
||||||||||
| independent
of the problem's size N, then the |
|||||||||||
| time
requirement is defined as: O(1). |
|||||||||||