Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
(Add bruijn) |
Not a robot (talk | contribs) (Add Refal) |
||
| Line 8,725: | Line 8,725: | ||
return</syntaxhighlight> |
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}}== |
=={{header|Ring}}== |
||
<syntaxhighlight lang="ring"> |
<syntaxhighlight lang="ring"> |
||