Array #

Index-based access is fast $(O(1))$.

Insertion and deletion are slow $(O(n))$, except at the end.

There are fixed-size arrays and dynamic-size arrays.

There are one-dimensional arrays and multi-dimensional arrays.