title: Java - Collections.sort() performance
body: <p>I'm using <a href="http://java.sun.com/j2se/1.4.2/docs/api/java/util/Collections.html#sort%28java.util.List%29" rel="nofollow noreferrer">Collections.sort()</a> to sort a LinkedList whose elements implements Comparable interface, so they are sorted in a natural order. In the javadoc documentation its said this method uses <em>mergesort</em> algorithm which has n*log(n) performance.</p>
  <p>My question is if there is a more efficient algorithm to sort my LinkedList?</p>
  <p>The size of that list could be very high and sort will be also very frequent.</p>