I wonder what part of Wikipedia you're talking about. The following is a nice discussion
http://en.wikipedia.org/wiki/Sort_algorithm It says that Quicksort requires the smallest number of comparisons for average data (provided you don't make bad pivot choices), but it also explains that this is not always a good definition of "best."
