| Algorithm Efficiency |
|
|
|
|
|
|
|
|
|
|
|
| • | If a
problem of size N requires time that is |
|||||||||
| directly
proportional to N, |
||||||||||
| – | then
the problem is O(N). |
|||||||||
| • | If
the time requirement is directly |
|||||||||
| proportion
to Nsquared, |
||||||||||
| – | then
the problem is O(Nsquared), etc. |
|||||||||