giles
39f4c7a9a8
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 26s
Classic doubly-recursive solution returning the move count:
hanoi n from to via =
if n = 0 then 0
else hanoi (n-1) from via to + 1 + hanoi (n-1) via to from
For n = 10, returns 2^10 - 1 = 1023.
Exercises 4-arg recursion, conditional base case, and tail-position
addition. Uses 'to_' instead of 'to' for the destination param to
avoid collision with the 'to' keyword in for-loops — the OCaml
conventional workaround.
37 baseline programs total.
42 lines
833 B
JSON
42 lines
833 B
JSON
{
|
|
"anagrams.ml": 3,
|
|
"bag.ml": 3,
|
|
"balance.ml": 3,
|
|
"bfs.ml": 6,
|
|
"btree.ml": 39,
|
|
"brainfuck.ml": 75,
|
|
"caesar.ml": 215,
|
|
"calc.ml": 13,
|
|
"closures.ml": 315,
|
|
"csv.ml": 10,
|
|
"exception_handle.ml": 4,
|
|
"expr_eval.ml": 16,
|
|
"factorial.ml": 3628800,
|
|
"fraction.ml": 7,
|
|
"frequency.ml": 5,
|
|
"hanoi.ml": 1023,
|
|
"fizzbuzz.ml": 57,
|
|
"list_ops.ml": 30,
|
|
"json_pretty.ml": 24,
|
|
"lambda_calc.ml": 7,
|
|
"levenshtein.ml": 11,
|
|
"memo_fib.ml": 75025,
|
|
"merge_sort.ml": 44,
|
|
"module_use.ml": 3,
|
|
"mutable_record.ml": 10,
|
|
"option_match.ml": 5,
|
|
"pi_leibniz.ml": 314,
|
|
"poly_stack.ml": 5,
|
|
"queens.ml": 2,
|
|
"quicksort.ml": 44,
|
|
"roman.ml": 44,
|
|
"safe_div.ml": 20,
|
|
"shuffle.ml": 55,
|
|
"word_freq.ml": 8,
|
|
"sieve.ml": 15,
|
|
"sum_squares.ml": 385,
|
|
"unique_set.ml": 9,
|
|
"validate.ml": 417,
|
|
"word_count.ml": 3
|
|
}
|