diff options
Diffstat (limited to 'samples/rosetta')
| -rw-r--r-- | samples/rosetta/ackermann.bruijn | 17 | ||||
| -rw-r--r-- | samples/rosetta/sorting_quicksort.bruijn | 13 |
2 files changed, 30 insertions, 0 deletions
diff --git a/samples/rosetta/ackermann.bruijn b/samples/rosetta/ackermann.bruijn new file mode 100644 index 0000000..c0689f1 --- /dev/null +++ b/samples/rosetta/ackermann.bruijn @@ -0,0 +1,17 @@ +:import std/Combinator . +:import std/Number/Unary U +:import std/Math . + +# unary ackermann +ackermann-unary [0 [[U.inc 0 1 (+1u)]] U.inc] + +:test (ackermann-unary (+0u) (+0u)) ((+1u)) +:test (ackermann-unary (+3u) (+4u)) ((+125u)) + +# ternary ackermann (lower space complexity) +ackermann-ternary y [[[=?1 ++0 (=?0 (2 --1 (+1)) (2 --1 (2 1 --0)))]]] + +:test ((ackermann-ternary (+0) (+0)) =? (+1)) ([[1]]) +:test ((ackermann-ternary (+3) (+4)) =? (+125)) ([[1]]) + +main [[0]] diff --git a/samples/rosetta/sorting_quicksort.bruijn b/samples/rosetta/sorting_quicksort.bruijn new file mode 100644 index 0000000..f55f128 --- /dev/null +++ b/samples/rosetta/sorting_quicksort.bruijn @@ -0,0 +1,13 @@ +: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))) + +main [[0]] |