
Introduction
As our programs execute, we often need a means to organize data in mem-
ory. In Chapters 8 and 9, we used arrays as a convenient method to store
multiple variables of the same data type. In Chapter 9, we also introduced
the ArrayList as an array that dynamically expands, as needed.
In fact, arrays and ArrayLists are just two examples of data structures,
which are methodologies a program uses to store its data in memory.
An ArrayList dynamically adjusts its size by increasing its capacity by
approximately 50% whenever it runs out of space. If an ArrayList’s current
capacity is 640 objects, and it is full (that is, it holds 640 objects), ...