11 2024 档案

sicp每日一题[2.85-2.86]
摘要：sicp每日一题[2.85-2.86]从 2.83 开始我感觉做的有点怪怪的，我似乎没有很好地理解这些题目的目的，也没有在写完之后用测试样例监测，只是简单的实现了那个逻辑。所以做到练习 2.85 我已经不知道在干什么了，所以我决定重新写一遍，把实数这一层也加上，同时每道题目新增的过程都要有对应的测试样例。 结果写了两天也没写出来，参考别 阅读全文
posted @ 2024-11-23 14:07 再思即可 阅读(11) 评论(0) 推荐(0) 编辑
sicp每日一题[2.84]
摘要：sicp每日一题[2.84]Exercise 2.84 Using the raise operation of Exercise 2.83, modify the apply-generic procedure so that it coerces its arguments to have the same type by 阅读全文
posted @ 2024-11-21 08:41 再思即可 阅读(2) 评论(0) 推荐(0) 编辑
sicp每日一题[2.83]
摘要：sicp每日一题[2.83]Exercise 2.83 Suppose you are designing a generic arithmetic system for dealing with the tower of types shown in Figure 2.25: integer, rational, real, 阅读全文
posted @ 2024-11-20 08:10 再思即可 阅读(6) 评论(0) 推荐(0) 编辑
sicp每日一题[2.82]
摘要：sicp每日一题[2.82]Exercise 2.82 Show how to generalize apply-generic to handle coercion in the general case of multiple arguments. One strategy is to attempt to coerce 阅读全文
posted @ 2024-11-19 08:59 再思即可 阅读(12) 评论(0) 推荐(0) 编辑
sicp每日一题[2.81]
摘要：sicp每日一题[2.81]Exercise2.81 Louis Reasoner has noticed that apply-generic may try to coerce the arguments to each other’s type even if they already have the same typ 阅读全文
posted @ 2024-11-18 08:39 再思即可 阅读(4) 评论(0) 推荐(0) 编辑
sicp每日一题[2.80]
摘要：sicp每日一题[2.80]Exercise 2.80 Define a generic predicate =zero? that tests if its argument is zero, and install it in the generic arithmetic package. This operation s 阅读全文
posted @ 2024-11-17 08:57 再思即可 阅读(3) 评论(0) 推荐(0) 编辑
sicp每日一题[2.79]
摘要：sicp每日一题[2.79]Exercise2.79 Define a generic equality predicate equ? that tests the equality of two numbers, and install it in the generic arithmetic package. This o 阅读全文
posted @ 2024-11-16 13:23 再思即可 阅读(3) 评论(0) 推荐(0) 编辑
sicp每日一题[2.78]
摘要：sicp每日一题[2.78]Exercise2.78 The internal procedures in the scheme-number package are essentially nothing more than calls to the primitive procedures +, -, etc. It wa 阅读全文
posted @ 2024-11-15 19:24 再思即可 阅读(2) 评论(0) 推荐(0) 编辑
sicp每日一题[2.77]
摘要：sicp每日一题[2.77]Exercise 2.77 Louis Reasoner tries to evaluate the expression (magnitude z) where z is the object shown in Figure 2.24. To his surprise, instead of th 阅读全文
posted @ 2024-11-14 19:37 再思即可 阅读(6) 评论(0) 推荐(0) 编辑
sicp每日一题[2.76]
摘要：sicp每日一题[2.76]Exercise 2.76 As a large system with generic operations evolves, new types of data objects or new operations may be needed. For each of the three stra 阅读全文
posted @ 2024-11-13 19:30 再思即可 阅读(3) 评论(0) 推荐(0) 编辑
sicp每日一题[2.75]
摘要：sicp每日一题[2.75]Exercise2.75 Implement the constructor make-from-mag-ang in message-passing style. This procedure should be an alogous to the make-from-real-imag proc 阅读全文
posted @ 2024-11-12 19:52 再思即可 阅读(3) 评论(0) 推荐(0) 编辑
sicp每日一题[2.74]
摘要：sicp每日一题[2.74]Exercise 2.74 Insatiable Enterprises, Inc., is a highly decentralized conglomerate company consisting of a large number of independent divisions locat 阅读全文
posted @ 2024-11-11 19:43 再思即可 阅读(7) 评论(0) 推荐(0) 编辑
sicp每日一题[2.73]
摘要：sicp每日一题[2.73]最近状态不太好，再加上2.73前面的内容有点多，学的有点吃力，所以昨天就没做。。 Exercise 2.73 Section 2.3.2 described a program that performs symbolic differentiation: (define (deriv exp va 阅读全文
posted @ 2024-11-09 22:20 再思即可 阅读(6) 评论(0) 推荐(0) 编辑
sicp每日一题[2.72]
摘要：sicp每日一题[2.72]Exercise 2.72 Consider the encoding procedure that you designed in Exercise 2.68. What is the order of growth in the number of steps needed to encode 阅读全文
posted @ 2024-11-07 18:43 再思即可 阅读(1) 评论(0) 推荐(0) 编辑
sicp每日一题[2.71]
摘要：sicp每日一题[2.71]Exercise 2.71 Suppose we have a Huffman tree for an alphabet of n symbols, and that the relative frequencies of the symbols are 1,2,4, . . . ,2n 1. Sk 阅读全文
posted @ 2024-11-06 22:03 再思即可 阅读(6) 评论(0) 推荐(0) 编辑
sicp每日一题[2.70]
摘要：sicp每日一题[2.70]Exercise 2.70 The following eight-symbol alphabet with associated relative frequencies was designed to efficiently encode the lyrics of 1950s rock son 阅读全文
posted @ 2024-11-05 20:37 再思即可 阅读(1) 评论(0) 推荐(0) 编辑
sicp每日一题[2.69]
摘要：sicp每日一题[2.69]Exercise 2.69 The following procedure takes as its argument a list of symbol-frequency pairs (where no symbol appears in more than one pair) and gener 阅读全文
posted @ 2024-11-04 19:55 再思即可 阅读(3) 评论(0) 推荐(0) 编辑
sicp每日一题[2.67-2.68]
摘要：sicp每日一题[2.67-2.68]Exercise 2.67 Define an encoding tree and a sample message: (define (make-leaf-set pairs) (if (null? pairs) '() (let ((pair (car pairs))) (adjoin-set 阅读全文
posted @ 2024-11-03 08:59 再思即可 阅读(6) 评论(0) 推荐(0) 编辑
sicp每日一题[2.66]
摘要：sicp每日一题[2.66]Exercise 2.66 Implement the lookup procedure for the case where the set of records is structured as a binary tree, ordered by the numerical values of 阅读全文
posted @ 2024-11-02 11:31 再思即可 阅读(4) 评论(0) 推荐(0) 编辑
sicp每日一题[2.65]
摘要：sicp每日一题[2.65]Exercise 2.65 Use the results of Exercise 2.63 and Exercise 2.64 to give (n) implementations of union-set and intersection-set for sets implemented as 阅读全文
posted @ 2024-11-01 08:42 再思即可 阅读(4) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示