You probably know how to create a top-level memoized recursive function in Clojure, but how do you create a local one? By local, I mean defined with let or letfn. For the lack of better example, consider a Clojure function that returns the n-th Fibonacci number. Here’s a top-level definition created with defn: (defn fibo[n](if (< n2)n(+ (fibo(dec n))(fibo(- n2))))) It’s a classic example of recursive function. However, the implementation above is not exactly efficient. If you run (fibo 50...
