How does Java sort arrays and lists with comparators?

"As with searching, the Arrays and Collections classes provide parameterized sorting methods to sort arrays and Lists. In Java 6 and prior, the implementation was a hybrid merge/insertion sort. Java 7 switched the implementation to Tim Sort. Here too, there are several variations that rely on the natural ordering or allow you to sort a subpart of the collection. The Arrays provides the following method, which sorts arrays of a particular type with a Comparator for that type.\n\npublic static <T> void sort(T[] a, Comparator<T> c)\n\nLikewise, Collections provides the following method.\n\npublic static <T> void sort(List<T> list, Comparator<T> c)\n\nSeveral examples of the usage of these methods are presented in Code Sample"