A list is an abstract data type defined as a collection of elements of a single declared type together with an operation interface; in its static form the interface is bounded read and write by position, while the dynamic form adds emptiness, size, insertion at any position, and removal. An array supplies the static list directly, and the dynamic list can be built over an array by maintaining an end marker delimiting the occupied prefix, shifting elements to preserve contiguity on insertion and removal, and reallocating to a larger array (conventionally double the size) with a full copy when capacity is exhausted. The concept sits in data structures within computer science and illustrates the discipline's two-level method: specify the ADT, choose a concrete implementation, then analyse the time and space cost each operation incurs under that choice.
A list is an abstract data type defined as a collection of elements of a single declared type together with an operation interface; in its static form the interface is bounded read and write by posit…