Bounded-size Dynamic Arrays and Capacity
The simplest dynamic array is constructed by allocating a fixed-size array and then dividing it into two parts: the first stores the elements of the dynamic array and the second is reserved, or unused. We can then add or remove elements at the end of the dynamic array in constant time by using the reserved space, until this space is completely consumed. The number of elements used by the dynamic array contents is its logical size or size, while the size of the underlying array is called the dynamic array's capacity, which is the maximum possible size without relocating data.
In applications where the logical size is bounded, the fixed-size data structure suffices. This may be short-sighted, when problems with the array filling up turn up later. It is best to put resize code into any array, to respond to new conditions. Then choosing initial capacity is optimization, not getting the program to run. Resizing the underlying array is an expensive task, typically involving copying the entire contents of the array.
Read more about this topic: Dynamic Array
Famous quotes containing the words dynamic and/or capacity:
“Knowledge about life is one thing; effective occupation of a place in life, with its dynamic currents passing through your being, is another.”
—William James (1842–1910)
“People between twenty and forty are not sympathetic. The child has the capacity to do but it can’t know. It only knows when it is no longer able to do—after forty. Between twenty and forty the will of the child to do gets stronger, more dangerous, but it has not begun to learn to know yet. Since his capacity to do is forced into channels of evil through environment and pressures, man is strong before he is moral. The world’s anguish is caused by people between twenty and forty.”
—William Faulkner (1897–1962)