Sorting algorithms/Quicksort: Difference between revisions
Add bruijn
m (→{{header|Wren}}: Minor tidy) |
(Add bruijn) |
||
Line 2,887:
(quick,sober)
(quick,sort)</pre>
=={{header|Bruijn}}==
<syntaxhighlight lang="bruijn">
:import std/Combinator .
:import std/Number .
:import std/List .
sort y [[0 [[[case-sort]]] case-end]]
case-sort (4 lesser) ++ (2 : (4 greater))
lesser 1 <#> (\les? 2)
greater 1 <#> (\geq? 2)
case-end empty
:test (sort ((+3) : ((+2) : {}(+1)))) ((+1) : ((+2) : {}(+3)))
</syntaxhighlight>
=={{header|C}}==
| |||