sicp每日一题[1.33]

再思即可

已于 2024-08-27 12:35:11 修改

阅读量911

点赞数 15

分类专栏： sicp 文章标签： lisp

于 2024-08-27 12:23:03 首次发布

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

版权

sicp 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Exercise 1.33

You can obtain an even more general version of $a cc u m u l a t e$ (Exercise 1.32) by introducing the notion of a $f i lt er$ on the terms to be combined. That is,combine only those terms derived from values in the range that satisfy a specified condition. The resulting $f i lt ere d - a cc u m u l a t e$ abstraction takes the same arguments as accumulate, together with an additional predicate of one argument that specifies the filter. Write $f i lt ere d - a cc u m u l a t e$ as a procedure. Show how to express the following using $f i lt ere d - a cc u m u l a t e$ :

a. the sum of the squares of the prime numbers in the interval $a$ to $b$ (assuming that you have a $p r im e ?$ predicate already written)
b. the product of all the positive integers less thann that are relatively prime to $n$ (i.e., all positive integers $i < n$ such that $GC D (i, n) = 1$ ).

answer :

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

; for a
; computes the summation of the squares of the prime numbers in the interval a to b
(define (sum-prime-square a b)
  (filtered-accumulate-recur + 0 square a inc b prime?))

; for b
; computers the production of all the positive integers less thann that are relatively prime to n
(define (product-prime n)
  (filtered-accumulate-recur * 1 identity 1 inc n prime?))

(sum-prime-square 0 10)
(product-prime 10)
> result
87
210


; iterative implementation
(define (filtered-accumulate-iter combiner null-value term a next b filter)
  (define (iter a result)
    (if (> a b)
        result
        (if (filter a)
            (iter (next a) (combiner (term a) result))
            (iter (next a) result))))
  (iter a null-value))

; for a
; computes the summation of the squares of the prime numbers in the interval a to b
(define (sum-prime-square a b)
  (filtered-accumulate-iter + 0 square a inc b prime?))

; for b
; computers the production of all the positive integers less thann that are relatively prime to n
(define (product-prime n)
  (filtered-accumulate-iter * 1 identity 1 inc n prime?))

(sum-prime-square 0 10)
(product-prime 10)
> result
87
210