Which one runs faster, ArrayList or LinkedList? [duplicate]

Which one runs faster, ArrayList or LinkedList? [duplicate]

This question already has an answer here:
When to use LinkedList<> over ArrayList<>? 24 answers
Performance differences between ArrayList and LinkedList 6 answers
List li = new LinkedList();
for (int i = 0; i < 100; i++) {
li.add(i);
}
long start1 = System.nanoTime();
li.get(57);
long end1 = System.nanoTime();
long diff1 = end1-start1;
System.out.println("Time taken by LinkedList = "+diff1);
List al = new ArrayList();
for (int i = 0; i < 100; i++) {
al.add(i);
}
long start2 = System.nanoTime();
al.get(57);
long end2 = System.nanoTime();
long diff2 = end2-start2;
System.out.println("Time taken ArrayList = "+diff2);
System.out.println((diff1<diff2)?"LinkedList runs faster":"ArrayList
runs faster");
}
What ever operations i perform on both the Lists, when i print out the
time taken, it is always ArrayList that runs faster. Can somebody explain
which performs better in terms of time taken? Also let me know if there is
something wrong in the code. Thanks!