What algorithm is used by Collection.sort?
Answer:
Short answer - MergeSort (nlogn).
Long answer - Modified Merge Sort. The list is dumped into an array. Sorts the array. Iterates the list resetting each element from the corresponding position in the array. (this whole business of copying is done to avoid n2logn time for Linked List).