| Efficiency... |
|
|
|
|
|
|
|
|
|
|
| • | Now
that we have seen a partial example |
||||||||
| of
a list abstraction, we should examine |
|||||||||
| the
efficiency of using an array versus a |
|||||||||
| linked
list for the data structure |
|||||||||
| • | An
array allows for direct access, which is |
||||||||
| only
useful if you know the position of |
|||||||||
| where
the data is located |
|||||||||
| • | If
the array is sorted, then a binary search |
||||||||
| can
be used to get to the correct position |
|||||||||
