The time complexity of Collections.sort() is O(n*log(n)) and a list sorted with Collections.sort() will only be sorted after the call to sort().
Information present in collections documentation -
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.
