Question

In a case where the only operation being performed on a list is non-random access (no removals, additions, or other tom-foolery), would it be advisable to use an array, ArrayList, LinkedList, or something else? or is it irrelevant which is selected?

Answer 1

Except in some specific situations (like embedded systems), you are likely working with a hierarchical and/or virtual memory system.

While the implementation details of this have been sufficiently abstracted by the operating system or hardware so that it is transparent to you, there are still some important considerations.

An array based implementation will exhibit a higher degree of spatial locality between elements than independently linked elements.

http://en.wikipedia.org/wiki/Locality_of_reference

In computer science, locality of
reference, also known as the principle
of locality, is the phenomenon of the
same value or related storage
locations being frequently accessed.
There are two basic types of reference
locality. Temporal locality refers to
the reuse of specific data and/or
resources within relatively small time
durations. Spatial locality refers to
the use of data elements within
relatively close storage locations.
Sequential locality, a special case of
spatial locality, occurs when data
elements are arranged and accessed
linearly, e.g., traversing the
elements in a one-dimensional array.

Locality is merely one type of
predictable behavior that occurs in
computer systems. Systems which
exhibit strong locality of reference
are good candidates for performance
optimization through the use of
techniques, like the cache and
instruction prefetch technology for
memory, or like the advanced branch
predictor at the pipelining of
processors.

Based on this, all other things being equal, I would choose ArrayList over LinkedList.