Sorting algorithms/Quicksort: Difference between revisions
m
→{{header|11l}}: Void
(Add bruijn) |
Alextretyak (talk | contribs) m (→{{header|11l}}: Void) |
||
| (3 intermediate revisions by 2 users not shown) | |||
Line 82:
{{trans|Python}}
<syntaxhighlight lang="11l">F _quicksort(&array, start, stop) ->
I stop - start > 0
V pivot = array[start]
Line 2,896:
sort y [[0 [[[case-sort]]] case-end]]
case-sort (4 lesser) ++ (2 : (4 greater))
lesser
greater
case-end empty
Line 8,725:
return</syntaxhighlight>
=={{header|Refal}}==
<syntaxhighlight lang="refal">$ENTRY Go {
, 7 6 5 9 8 4 3 1 2 0: e.Arr
= <Prout e.Arr>
<Prout <Sort e.Arr>>;
};
Sort {
= ;
s.N = s.N;
s.Pivot e.X =
<Sort <Filter s.Pivot '-' e.X>>
<Filter s.Pivot '=' e.X>
s.Pivot
<Sort <Filter s.Pivot '+' e.X>>;
};
Filter {
s.N s.Comp = ;
s.N s.Comp s.I e.List, <Compare s.I s.N>: {
s.Comp = s.I <Filter s.N s.Comp e.List>;
s.X = <Filter s.N s.Comp e.List>;
};
};</syntaxhighlight>
{{out}}
<pre>7 6 5 9 8 4 3 1 2 0
0 1 2 3 4 5 6 7 8 9</pre>
=={{header|Ring}}==
<syntaxhighlight lang="ring">
| |||