上一页 1 2 3 4 5 6 ··· 8 下一页
摘要: 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 再思即可 阅读(1) 评论(0) 推荐(0) 编辑
摘要: 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 再思即可 阅读(3) 评论(0) 推荐(0) 编辑
摘要: 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] 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 再思即可 阅读(4) 评论(0) 推荐(0) 编辑
摘要: 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] 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 再思即可 阅读(2) 评论(0) 推荐(0) 编辑
摘要: 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 再思即可 阅读(3) 评论(0) 推荐(0) 编辑
摘要: 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 再思即可 阅读(2) 评论(0) 推荐(0) 编辑
摘要: 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 再思即可 阅读(2) 评论(0) 推荐(0) 编辑
摘要: sicp每日一题[2.63-2.64] Exercise 2.63 Each of the following two procedures converts a binary tree to a list. (define (tree->list-1 tree) (if (null? tree) '() (append (tree->l 阅读全文
posted @ 2024-10-31 08:40 再思即可 阅读(2) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 ··· 8 下一页