SICP 1.11-1.13

习题1.11
1.递归算法

(define (f n)
        (if (< n 3)
            n
            (+ (f (- n 1))
               (* 2
                  (f (- n 2)))
               (* 3
                  (f (- n 3))))))

2.迭代算法

(define (f n)
  (define (f-iter n1 n2 n3 step-count)
     (if (< step-count 0)
         n3
         (f-iter n2
                 n3
                 (+ (* 3 n1) (* 2 n2) n3)
                 (- step-count 1))))
  (if (< n 3)
      n
      (f-iter 0 1 2 (- n 3)))) ;此处已经进行了前3次运算,所以减3

---

习题1.12

(define (pascal row col)
  (cond ((or (< col 1)
             (< row 1))
         0)
        ((or (= col 1)
             (= row col)
             (< row 3))
         1)
        (else (+ (pascal (- row 1) (- col 1))
                 (pascal (- row 1) col)))))

---

习题1.13
略