sicp每日一题[1.30-1.31]

Exercise 1.31

• a. The sum procedure is only the simplest of a vast number of similar abstractions that can be captured as higher order procedures.51 Write an analogous procedure called product that returns the product of the values of a function at points over a given range. Show how to define factorial in terms of product. Also use product to compute approximations to π using the formula
  $\frac{\pi }{4}=\frac{2\cdot 4\cdot 4\cdot 6\cdot 6\cdot \mathrm{8...}}{3\cdot 3\cdot 5\cdot 5\cdot 7\cdot \mathrm{7...}}$
• b. If your product procedure generates a recursive process, write one that generates an iterative process. If it generates an iterative process, write one that generates a recursive process.

answer :

• a

(define (product-iter term a next b)
  (define (iter a result)
    (if (> a b)
        result
        (iter (next a) (* (term a) result))))
  (iter a 1))

(define (factorial n)
  (define (identity x) x)
  (product-iter identity 1 inc n))

(factorial 0)
(factorial 1)
(factorial 2)
(factorial 3)

> result
1
1
2
6

• b

(define (product-recur term a next b)
  (if (> a b)
      1
      (* (term a)
         (product-recur term (next a) next b))))

(define (factorial n)
  (define (identity x) x)
  (product-recur identity 1 inc n))

(factorial 0)
(factorial 1)
(factorial 2)
(factorial 3)

> result
1
1
2
6