<story><title>Why is quicksort better than other sorting algorithms in practice? (2013)</title><url>https://cs.stackexchange.com/questions/3/why-is-quicksort-better-than-other-sorting-algorithms-in-practice</url></story><parent_chain></parent_chain><comment><author>amelius</author><text>There are annual contests for sorting large amounts of data, e.g.:&lt;p&gt;&lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;sortbenchmark.org&amp;#x2F;&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;sortbenchmark.org&amp;#x2F;&lt;/a&gt;&lt;p&gt;(I could be wrong but I don&amp;#x27;t think the winners ever used Quicksort.)</text></comment>
<story><title>Why is quicksort better than other sorting algorithms in practice? (2013)</title><url>https://cs.stackexchange.com/questions/3/why-is-quicksort-better-than-other-sorting-algorithms-in-practice</url></story><parent_chain></parent_chain><comment><author>Aardwolf</author><text>There are too many different tradeoffs and dimensions to the problem to say that one sorting algorithm is the &amp;quot;best&amp;quot;. E.g. quicksort without fallback has a denial of service attack against it.</text></comment>