sicp每日一题[1.32]

再思即可

已于 2024-08-29 12:00:49 修改

阅读量291

点赞数 4

文章标签： lisp 个人开发

于 2024-08-26 11:27:51 首次发布

本文链接：https://blog.csdn.net/ilongchaos/article/details/141559490

版权

Exercise 1.32

a. Show that sum and product (Exercise 1.31) are both special cases of a still more general notion called $a cc u m u l a t e$ that combines a collection of terms, using some general accumulation function:
(accumulate combiner null-value term a next b)
$a cc u m u l a t e$ takes as arguments the same term and range specifications as $s u m$ and $p ro d u c t$ ,together with a $co mbin er$ procedure (of two arguments) that specifies how the current term is to be combined with the accumulation of the preceding terms and a $n u ll - v a l u e$ that specifies what base value to use when the terms run out. Write $a cc u m u l a t e$ and show how $s u m$ and $p ro d u c t$ can both be defined as simple calls to $a cc u m u l a t e$ .

b. If your $a cc u m u l a t e$ 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 :

; use recursive
(define (accumulate-recur combiner null-value term a next b)
  (if (> a b)
      null-value
      (combiner (term a)
                (accumulate-recur combiner null-value term (next a) next b))))

; computes the summation of two numbers
(define (sum a b)
  (accumulate-recur + 0 identity a inc b))

; computers the production of two numbers
(define (product a b)
  (accumulate-recur * 1 identity a inc b))

(sum 3 5)
(product 3 5)

; use iter
(define (accumulate-iter combiner null-value term a next b)
  (define (iter a result)
    (if (> a b)
        result
        (iter (next a) (combiner (term a) result))))
  (iter a null-value))

; computes the summation of two numbers
(define (sum a b)
  (accumulate-iter + 0 identity a inc b))

; computers the production of two numbers
(define (product a b)
  (accumulate-iter * 1 identity a inc b))

(sum 3 5)
(product 3 5)