random access

ref. to how to access data. Random access is also called direct access, you can read and write anywhere in the random access; in the sequential access you have to read or write in a sequence.  it seems random access is more efficient access than sequential access.

In java, there is a pubic interface modifier, java.util.RandomAccess.
ArrayList is the one typically implement this interface;

It needs to consider the performance view implementing RandomAcess, or not.

ArrayList implements RandomAcess, but LinkedList implements not. How to compare them on accessing?

I think the random access in the linked-list is not efficient.