Array #

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

Data insertion and deletion are slow $(O(n))$, except at the end $(O(1))$.

There are fixed-size and dynamic-size arrays.

There are one-dimensional and multi-dimensional arrays.