3 [clojure.contrib trace test-is]))
5 ;; exercise 1.11: A function f is defined by the rule that f(n) = n if n < 3
6 ;; and f(n) = f(n - 1) + 2f(n - 2) + 3f(n - 3) if n> 3.
7 ;; Write a procedure that computes f by means of a recursive
8 ;; process. Write a procedure that computes f by means of an
18 ;; user> (map f (range 10))
19 ;; (0 1 2 4 11 25 59 142 335 796)
22 ;; ex 1.11: iterative version
23 (defn f-iter [count prev0 prev1 prev2]
40 ;; ex 1.11: iterative version with let
41 (defn f-iter [count prev0 prev1 prev2]
42 (let [res (+ prev0 (* 2 prev1) (* 3 prev2))]