 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
What
this tells us is that a dynamically
|
|
|
allocated
list is better than a statically
|
|
|
allocated
list (one less problem)
|
|
|
|
– |
if
the cost of memory allocation for the array is
|
|
|
manageable
at run-time.
|
|
|
|
– |
may
not be reasonable if a large quantity of instances of
|
|
|
an
ordered_list are formed
|
|
|
|
– |
is
not required if the size of the data is known up-front at
|
|
compile
time (and is the same for each instance of the
|
|
|
class)
|
|