Talk:Sorting algorithms/Quicksort: Difference between revisions
algorithm description
No edit summary |
(algorithm description) |
||
Line 5:
--[[User:Kevin Reid|Kevin Reid]] 15:42, 3 October 2007 (MDT)
:I'd say follow example of the [[Bubble Sort]] page (from which I stole the text). In other words, do whatever is most comfortable in your language, perhaps pointing out the design choices made. --[[User:IanOsgood|IanOsgood]] 19:02, 3 October 2007 (MDT)
==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)
| |||