SICP(计算机程序的构造与解释)schemepratice,自己写的1.45~2.65的大部分题目都包括了。.doc

(define (intergral_origin f a b delt sum) (cond ((= a b) sum) (else (+ sum (f a) (intergral_origin f (+ a delt) b delt sum))))) (define (intergral f a b) (* 0.0001 (intergral_origin f a b 0.0001 0))) ;;简单的一元函数求积分，积分步长是0.0001 ;;折半求根方法 ;调用pre_search查找根 (define (pre_search f a b) (let ( (val_a (f a)) (val_b (f b))) (cond ( ( (* val_a val_b) 0) (error f(a) and f(b) share a sign)) ( ( val_a 0) (_search f b a)) (else (_search f a b))))) (define (enough? x y) ( 0.00001 (abs (- x y)))) (define average (lambda (x y) (/ (+ x y) 2.0))) (define (_search func neg_point pos_point) (let ((midpoint (average neg_point pos_point))) (if (enough? neg_point pos_point) midpoint (let ((midval (func midpoint))) (cond ((= midval 0) midpoint) (( midval 0) (_search func neg_point midpoint)) (else (_search func midpoint pos_point))))))) ;;fix-point ;;这个只是迭代，时候收敛需要自己确定f(x)收敛情况 (define (fix-point f x) (display x) ;;显示迭代过程 (newline) (let ((next (f x))) (if (enough? x next) next (fix-point f next)))) ;;差值近似求导 (define d (lambda (f x delt) (/ (- (f (+ x delt)) (f x)) delt))) ;;牛顿法的变形 (define (newton-fix g) (lambda (x) (- x (/ (g x) (d g x 0.000001))))) (define (newton-method g guess) (fix-point (newton-fix g) guess)) (define (mysq x) (newton-method (lambda (y) (- x (* y y ))) 1.0)) ;;lambda定义匿名过程，参数尤其灵活) (define (cubic a b c) (lambda (x) (+ (* x x x) (* a x x) (* b x) c)));;pratice 1.40 (define (double f) (lambda (x) (f (f x)))) ;;(((double (double double)) inc) 5) =21 = 5 + 16 (define (compose f g) (lambda (x) (f (g x)))) ;; pratice 1.42 (define (square x) (* x x)) ;;repeat 的三个版本 (define (even? x) (= 0 (remainder x 2))) (define ((repeat f n) x);;版本1，一般的define (cond ((= n 1) (f x)) (else ((compose f (repeat f (- n 1))) x)))) (define (repeat1 f n) ;;版本2 ，版本1的lambda版 (lambda (x) (cond ((= n 1) (f x)) (else ((compose f (repeat1 f (- n 1))) x)