For 10 points, name this data structure which, like a linked list, contains a number of elements in order.
Control tables are a type of this object used to avoid explicit branch statements. Bounds-checking can spot common compile time exceptions using these objects, and implementation of "sparse" varieties avoid allocating memory for default values. These objects can be dynamically resized so that insertions at the end require amortized constant time, and a description of this object is often held in a dope vector. These objects are used when locality of reference is important, so that (*) pointer arithmetic is often used to access these data structures, which are numbered starting with zero. Unlike a similar data type this structure supports random access. For 10 points, name this data structure which, like a linked list, contains a number of elements in order.
Control tables are a type of this object used to avoid explicit branch statements.
{Array}