 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
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 the array sizes are very large
|
|
|
|
or if
there are many stack objects
|
|
|
|
– |
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)
|
|