rosetta/sorting_quicksort.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 (\lt? 2) <#> 1
		greater (\ge? 2) <#> 1
	case-end empty

:test (sort ((+3) : ((+2) : {}(+1)))) ((+1) : ((+2) : {}(+3)))

main [[0]]