Expanding on this: usually linked lists allocate each element with a separate malloc() on the heap, so they end up all over the place in memory.

You could, in principle, allocate your linked list out of contiguous memory in such a way that sequentially reading the list doesn't cause so many page accesses. That would itself be a complicated data structure to maintain, so simply using a linear array is often the right tradeoff.