| Algorithm Efficiency |
|
|
|
|
|
|
|
|
|
|
|
|
| • | There
is one side note that we should |
||||||||||
| consider. |
|||||||||||
| – | When
evaluating an algorithm's efficiency, we |
||||||||||
| always
need to keep in mind the trade-offs |
|||||||||||
| between
execution time and memory |
|||||||||||
| requirements. |
|||||||||||
| – | The
Big O notation is denoting execution time |
||||||||||
| and
does not fill us in concerning memory |
|||||||||||
| requirements
and/or algorithm limitations. |
|||||||||||