Anonymous user
Talk:Sorting algorithms/Quicksort: Difference between revisions
→Algorithm description
(→Task statement is buggy: Last warning about vitriol and malice. Others chime in about Quicksort, please.) |
|||
Line 19:
==Algorithm description==
Would someone care to add some text describing the Quicksort algorithm? I.e., its worst-case completion time, a pseudocode implementation, what the pivot does, etc. --[[User:Short Circuit|Short Circuit]] 03:28, 7 October 2007 (MDT)
: Quicksort is an elegant and powerful algorithm. If you want to learn about it, read the [http://comjnl.oxfordjournals.org/cgi/content/short/5/1/10 Hoare's original 1962 paper on Quicksort]. Note that the task description and code here on Rosetta Code are wrong.
== UnixPipes solution ==
| |||