Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 503: | Line 503: | ||
qsort([X|Xs]) -> |
qsort([X|Xs]) -> |
||
qsort([ Y || Y <- Xs, Y < X]) ++ [X] ++ qsort([ Y || Y <- Xs, Y >= X]).</lang> |
qsort([ Y || Y <- Xs, Y < X]) ++ [X] ++ qsort([ Y || Y <- Xs, Y >= X]).</lang> |
||
=={{header|F_sharp|F#}}== |
|||
<lang fsharp> |
|||
let rec qsort = function |
|||
[] -> [] |
|||
| x::xs -> |
|||
qsort [for a in xs do if a < x then yield a]@x:: |
|||
qsort [for a in xs do if a >= x then yield a] |
|||
</lang> |
|||
=={{header|Factor}}== |
=={{header|Factor}}== |
||