参考：https://docs.oracle.com/javase/6/docs/api/java/util/Collections.html#sort%28java.util.List%29
https://stackoverflow.com/questions/4254122/what-is-the-time-complexity-of-java-util-collections-sort-method

这取决于您使用的Java版本.但是最后,Big-O时间复杂度仍然是O(N * log(N)).
对于Java 6,它是mergesort的修改版本.在这里查看说明：Collections#sort for Java 6

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n log(n) performance. The specified list must be modifiable, but need not be resizable. This implementation dumps the specified list into an array, sorts the array, and iterates over the list resetting each element from the corresponding position in the array. This avoids the n2 log(n) performance that would result from attempting to sort a linked list in place.

对于Java 7,已进行了改进：由于enhancement而导致的改进为：Collections#sort for Java 7.请注意,TimSort具有O(N)的最佳情况,并且被证明比以前的实现更快.

Implementation note: This implementation is a stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when the input array is partially sorted, while offering the performance of a traditional mergesort when the input array is randomly ordered. If the input array is nearly sorted, the implementation requires approximately n comparisons. Temporary storage requirements vary from a small constant for nearly sorted input arrays to n/2 object references for randomly ordered input arrays.

The implementation takes equal advantage of ascending and descending order in its input array, and can take advantage of ascending and descending order in different parts of the same input array. It is well-suited to merging two or more sorted arrays: simply concatenate the arrays and sort the resulting array.

The implementation was adapted from Tim Peters’s list sort for Python ( 07004). It uses techiques from Peter McIlroy’s “Optimistic Sorting and Information Theoretic Complexity”, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, January 1993.

This implementation dumps the specified list into an array, sorts the array, and iterates over the list resetting each element from the corresponding position in the array. This avoids the n2 log(n) performance that would result from attempting to sort a linked list in place.

Is this a good method for sorting an ArrayList of 10^6?

从理论上讲,使用就足够了.但这使我想知道为什么您必须对内存中的数据进行排序.如果数据来自数据库,则使用索引的列/字段在那里进行排序,否则检查是否知道要用于排序的字段的某些特征,以及是否可以使用O(N)时间复杂度算法,例如Bucket Sort或Radix Sort.如果没有其他方法,请使用Collections#sort.