1 ;; Some inefficient arithmetic computations for benchmarking.
3 ;; Unfortunately not yet available in tests of steps 4 and 5.
5 ;; Compute n(n+1)/2 with a non tail-recursive call.
7 (fn* [n] ; non-negative number
10 (+ n (sumdown (- n 1))))))
12 ;; Compute a Fibonacci number with two recursions.
14 (fn* [n] ; non-negative number
17 (+ (fib (- n 1)) (fib (- n 2))))))