A major advantage of sequential representation is that indexing (finding the value at a given index) takes constant time. In a linked list, indexing requires following pointers, and takes time proportional to the index being sought.

Languages that encourage programmers to use indexing would benefit from using sequential representation.