Data Structures
Relative lists: (statically allocated arrays)
direct access for retrieve
problem: searching!
Insert might cause the data to be inserted somewhere other than what the position
specifies (i.e., if the position # is greater
than the next open position)
problem: shifting!
Remove, insert alters all subsequent data
problem: memory limitations (fixed size)
problem: must guess at the SIZE at compile time