some solutions for MIT Press's "structure and interpretation of computer programs", I guess
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
(define (compose f g) |
|
(lambda (x) (f (g x)))) |
|
|
|
(define (repeated f n) |
|
(if (< n 1) |
|
(lambda (x) x) |
|
(compose f (repeated f (- n 1))))) |
|
|
|
(define dx 0.00001) |
|
|
|
(define (smooth f) |
|
(lambda (x) |
|
(/ (+ (f (- x dx)) |
|
(f x) |
|
(f (+ x dx))) |
|
3))) |
|
|
|
(define (n-smooth f n) |
|
((repeated smooth n) f))
|
|
|
