Java - Collections.sort() performance

Question

I\'m using Collections.sort() to sort a LinkedList whose elements implements Comparable interface, so they are sorted in a natural order. In the javadoc documentation its sa

Answer 1

There is no general sort algorithm better than n*log(n). And this is quite fast. By general I mean your data doesn't have special properties.