Talk:Sorting algorithms/Quicksort: Difference between revisions
New section: UnixPipes solution
(algorithm description) |
(New section: UnixPipes solution) |
||
Line 7:
==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)
== UnixPipes solution ==
It seems to me that the UnixPipes implementation violates the conditions given on [[:Category:UnixPipes]]: There you find:
:''It does not include programming problems solved with normal shell by using the control structures available as a part of shell outside of pipelines.''
However the quicksort implementation here uses the following shell constructs:
* named function
* while loop
* case statement
So either the example, or the UnixPipes description is wrong. --[[User:Ce|Ce]] 15:41, 7 April 2008 (MDT)
| |||