title: What is the time complexity of java.util.Collections.sort() method?
body: <p>I have written the following class:</p>
  
  <pre><code>public class SortingObjectsWithAngleField implements Comparator&lt;Point&gt; {  
      public int compare(Point p1, Point p2) {
          double delta = p1.getAngle() - p2.getAngle();
          if(delta == 0.00001)
              return 0;
          return (delta &gt; 0.00001) ? 1 : -1;
      }
  }
  </code></pre>
  
  <p>Then, in my <code>main()</code> method, I have created a <code>List</code> to which I add some objects which has "X" and "angle" field.</p>
  
  <p>I then use:</p>
  
  <pre><code>Collections.sort(list, new SortingObjectsWithAngleField());
  </code></pre>
  
  <p>What is the complexity of this sort method?</p>