UMBC CMSC 201 Fall '05
CSEE | 201 | 201 F'05 | lectures | news | help
Perhaps we would rather not use contiguous space. If we could spread the information around and store individual pieces where space exists to do so, we could store more information than by requiring contiguous space.
The solution would be a dynamic data structure that could shrink or grow during program execution as needed ... A collection of data items that need not be held contiguously in memory.