Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
m (→version 1: aligned a statement.) |
(Added Nix example) |
||
| Line 3,521: | Line 3,521: | ||
{{out}} |
{{out}} |
||
<pre>@[-31, 0, 2, 2, 4, 65, 83, 99, 782]</pre> |
<pre>@[-31, 0, 2, 2, 4, 65, 83, 99, 782]</pre> |
||
=={{header|Nix}}== |
|||
<lang nix> |
|||
let |
|||
qs = l: |
|||
if l == [] then [] |
|||
else |
|||
with builtins; |
|||
let x = head l; |
|||
xs = tail l; |
|||
low = filter (a: a < x) xs; |
|||
high = filter (a: a >= x) xs; |
|||
in qs low ++ [x] ++ qs high; |
|||
in |
|||
qs [4 65 2 (-31) 0 99 83 782] |
|||
</lang> |
|||
{{out}} |
|||
<pre>[ -31 0 2 4 65 83 99 782 ]</pre> |
|||
=={{header|Objeck}}== |
=={{header|Objeck}}== |
||