...
(define (cont-frac n d k) (define (cont-frac-helper i) (if (> i k) 0 (/ (n i) (+ (d i) (cont-frac-helper (+ i 1)))))) (cont-frac-helper 1)) (define (ln-cf k) (define (n k) 1.0) (define (d k) (if (= (remainder (+ k 1) 3) 0) (* (/ (+ k 1) 3) 2) 1)) (cont-frac n d k)) (ln-cf 10) (define (tan-cf x k) (define (n k) (if ( = k 1) x (* x x))) (define (d k) (- (* 2 k) 1)) (cont-frac n d k)) (tan-cf 0 10)
환영합니다. DrRacket, 버전 5.0.2 [3m].
언어: R5RS [사용자정의]; memory limit: 256 MB.
0.7182817182817183
0
>
언어: R5RS [사용자정의]; memory limit: 256 MB.
0.7182817182817183
0
>
;; exercises 1.46 (define (iterative-improve f enough? first-guess) (define (iter guess) (if (enough? guess) guess (iter (f guess)))) (iter first-guess)) (define (sqrt-iter-imp x) (iterative-improve (lambda (guess) (average guess (/ x guess))) (lambda (guess) (< (abs (- (square guess) x)) 0.001)) 1.0)) (define (fixed-point-iter-imp f first-guess) (iterative-improve f (lambda (guess) (< (abs (- guess (f guess))) 0.001)) first-guess))
이건 내꺼
;; ex 1.46 - iterative-improve (define (iterative-improve good? improve) (lambda (guess) (define (iter v) (if (good? v) v (iter (improve v)))) (iter guess))) ;; sqrt (define (sqrt-ii x) (define (good? guess) (< (abs (- (square guess) x)) 0.001)) (define (improve guess) (/ (+ guess (/ x guess)) 2)) ((iterative-improve good? improve) 1.0)) (sqrt-ii 9) ;; fixed-point (define (fixed-point-ii f g) (define (good? guess) (< (abs (- guess (f guess)) 0.00001))) ((iterative-improve good? f) g)) (fixed-point cos 1.0)