What is the time complexity of java.util.Collections.sort() method?

Question

I have written the following class:

public class SortingObjectsWithAngleField implements Comparator {  
    public int compare(Point p1, Point p         


        

Answer 1

Taken from Collections.sort -

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