Why would iterating over a List be faster than indexing through it?

Question

Reading the Java documentation for the ADT List it says:

The List interface provides four methods for positional (indexed) access to list elements. Li

Answer 1

To find the i-th element of a LinkedList the implementation goes through all elements up to the i-th.

So

for(int i = 0; i < list.length ; i++ ) {
    Object something = list.get(i); //Slow for LinkedList
}