Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
m (Redundant cat link) |
|||
| Line 251: | Line 251: | ||
writefln(quickSort(a2)); |
writefln(quickSort(a2)); |
||
} |
} |
||
=={{header|Erlang}}== |
|||
like haskell |
|||
qsort([]) -> []; |
|||
qsort([X|Xs]) -> |
|||
qsort([ Y || Y <- Xs, Y < X]) ++ [X] ++ qsort([ Y || Y <- Xs, Y >= X]). |
|||
=={{header|Forth}}== |
=={{header|Forth}}== |
||