Arrays have better cache locality as compared to linked lists.Linked lists are among the simplest and most common data structures.In computer science, a linked list is a linear collection of data elements, in which linear order is not given by their physical placement in memory. It is a data structure consisting of a group of nodes which together represent a sequence.Under the simplest form, each node is composed of data and a reference (in other words, a link) to the next node in the sequence.Several operating systems developed by Technical Systems Consultants (originally of West Lafayette Indiana, and later of Chapel Hill, North Carolina) used singly linked lists as file structures.A directory entry pointed to the first sector of a file, and succeeding portions of the file were located by traversing pointers.Each record of a linked list is often called an 'element' or 'node'.
LISP, standing for list processor, was created by John Mc Carthy in 1958 while he was at MIT and in 1960 he published its design in a paper in the Communications of the ACM, entitled "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I".
Systems using this technique included Flex (for the Motorola 6800 CPU), mini-Flex (same CPU), and Flex9 (for the Motorola 6809 CPU).
A variant developed by TSC for and marketed by Smoke Signal Broadcasting in California, used doubly linked lists in the same manner.
A drawback of linked lists is that access time is linear (and difficult to pipeline).
Faster access, such as random access, is not feasible.