;; Fibonacci Recursive
;; Benchmark: 33.3us
;; Benchmark-Repeat: 63
;; Output: 55
(do
  (def fib (fn [n]
    (if (< n 2)
      n
      (+ (fib (- n 1)) (fib (- n 2))))))

  (fib 10)
)