ArrayList vs LinkedList sorting speed?

package org.example;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.stream.Collectors;

public class SortExample {
  public static void main(String[] args) {
    List < Integer > numbers = fillWithLotsOfRandomValues(10_000_000);
    for (int i = 0; i < 10; i++) {
      testSortingSpeed(numbers);
    }
  }

  private static void testSortingSpeed(List < Integer > numbers) {
    List < Integer > arrayList = new ArrayList < > (numbers);
    List < Integer > linkedList = new LinkedList < > (numbers);
    sortList(arrayList);
    sortList(linkedList);
  }

  private static void sortList(List < Integer > list) {
    long time = System.currentTimeMillis();
    list.sort(null);
    time = System.currentTimeMillis() - time;
    System.out.println(list.getClass().getSimpleName() + " time = " + time);
  }

  private static List < Integer > fillWithLotsOfRandomValues(int n) {
    return ThreadLocalRandom.current().ints(n).parallel().boxed()
      .collect(Collectors.toList());
  }
}

package org.example;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.stream.Collectors;

public class SortExample {
  public static void main(String[] args) {
    List < Integer > numbers = fillWithLotsOfRandomValues(10_000_000);
    for (int i = 0; i < 10; i++) {
      testSortingSpeed(numbers);
    }
  }

  private static void testSortingSpeed(List < Integer > numbers) {
    List < Integer > arrayList = new ArrayList < > (numbers);
    List < Integer > linkedList = new LinkedList < > (numbers);
    sortList(arrayList);
    sortList(linkedList);
  }

  private static void sortList(List < Integer > list) {
    long time = System.currentTimeMillis();
    list.sort(null);
    time = System.currentTimeMillis() - time;
    System.out.println(list.getClass().getSimpleName() + " time = " + time);
  }

  private static List < Integer > fillWithLotsOfRandomValues(int n) {
    return ThreadLocalRandom.current().ints(n).parallel().boxed()
      .collect(Collectors.toList());
  }
}

"With Java 8, using an ArrayList should be slightly faster because Collections.sort will call List.sort and ArrayList has a specialised version that sorts the backing array directly, saving a copy.

So bottom line is ArrayList is better as it gives a similar or better performance depending on the version of Java."

"With Java 8, using an ArrayList should be slightly faster because Collections.sort will call List.sort and ArrayList has a specialised version that sorts the backing array directly, saving a copy.

So bottom line is ArrayList is better as it gives a similar or better performance depending on the version of Java."