What sorting algorithm is used in the Collections.sort method for ordering elements?

In Java, the method Collections.sort(List<T> list) uses a sorting algorithm based on a modified TimSort algorithm. TimSort is a hybrid stable sorting algorithm that combines merge sort and insertion sort, optimized for real-world data with partially sorted sequences.

This algorithm is efficient in terms of time and memory, especially for lists that are already partially sorted, which is common in practice.