 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
Lastly,
one algorithm might require
|
|
|
|
different
times to solve different problems
|
|
|
|
that
are of the same size.
|
|
|
|
– |
For
example, searching for an item that
|
|
|
|
appears
in the first location of a list will be
|
|
|
|
finished
sooner than searching for an item that
|
|
|
appears
in the last location of the list (or
|
|
|
|
doesn't
appear at all!).
|
|