Append and remove values, then run a linear scan across the occupied slots.
Contiguous storage, constant-time index access, and an O(n) cost to insert in the middle.
Add a value to begin.