sicp每日一题[2.22-2.23]

最新推荐文章于 2024-09-28 23:06:45 发布

再思即可

最新推荐文章于 2024-09-28 23:06:45 发布

阅读量675

点赞数 20

分类专栏： sicp 函数式编程 lisp 文章标签： sicp scheme 函数式编程编程 lisp

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

版权

sicp 同时被 3 个专栏收录

41 篇文章 0 订阅

订阅专栏

lisp

37 篇文章 0 订阅

订阅专栏

函数式编程

23 篇文章 0 订阅

订阅专栏

Exercise2.22

Louis Reasoner tries to rewrite the first $s q u a re - l i s t$ procedure of Exercise 2.21 so that it evolves an iterative process:

(define (square-list items)
  (define (iter things answer)
    (if (null? things)
        answer
        (iter (cdr things)
              (cons (square (car things))
                    answer))))
  (iter items nil))

Unfortunately, defining $s q u a re - l i s t$ this way produces the answer list in the reverse order of the one desired. Why?
Louis then tries to fix his bug by interchanging the arguments to $co n s$ :

(define (square-list items)
  (define (iter things answer)
    (if (null? things)
        answer
        (iter (cdr things)
              (cons answer
                    (square (car things))))))
  (iter items nil))

This doesn’t work either. Explain.

第一部分的代码得到的答案是倒序的，这个是因为程序里每次都把新加入的元素放到结果列表的开头；第二部分得到的答案是这样的：'(((((() . 1) . 9) . 25) . 49) . 81)，虽然顺序对了，这并不是我们想要的列表，其实只要在调用第一部分代码后再次调用之前练习里的 reverse 函数就可以得到顺序正确的列表了。

Exercise2.23

The procedure for-each is similar to map. It takes as arguments a procedure and a list of elements. How ever, rather than forming a list of the results, for-each just applies the procedure to each of the elements in turn, from left to right. The values returned by applying the procedure to the elements are not used at all— $f or - e a c h$ is used with procedures that perform an action, such as printing. For example,

(for-each(lambda(x)
           (newline)
           (display x))
         (list5732188))

57
321
88

The value returned by the call to $f or - e a c h$ (not illustrated above) can be something arbitrary, such as true. Give an implementation of $f or - e a c h$ .

这道题开始我不知道怎么连续执行 2 条程序，所以不知道怎么处理，后来上网查了一下，发现 $co n d$ 可以直接把多条语句放到一起执行，然后这道题就没有什么难度了。

(define (for-each f items)
  (cond ((not (null? items))
         (f (car items))
         (for-each f (cdr items)))))


(define test (list 57 321 88))
(for-each (lambda(x) (newline) (display x))
          test)

(newline)

(for-each (lambda(x) (newline) (display (square x)))
          test)

; 执行结果
57
321
88

3249
103041
7744