Zachary_wiz

摘要： Here are the fully expand steps:0) at the beginning , we get expression ``(car (cons 1 2))``1) replace ``cons`` using ``(lambda (m) (m x y))`` , we ge... 阅读全文

摘要： #lang racket(define (repeated f n) (define (compare f1 f2) (lambda(x) (f1 (f2 x)));lambda );compare (define (doing result n) (if (= ... 阅读全文

摘要： #lang racket(define (double f) (lambda (x) (f (f x)) );lambda );double(define ((double1 f) x) (f (f x)) )(define (inc x) (+ x 1) );inc(((d... 阅读全文

摘要： #lang racket(define (newton-transform g) (define dx 0.00001) (define (deriv g) (lambda (x) (/ (- (g (+ x dx)) (g x)) dx) );lambda );de... 阅读全文

摘要： #lang racket(define (cont-frac N D k) (define (cf t) (if (= t 1) (/ (N t) (D t)) (/ (N t) (+ (D t) (cf (- t 1)))) );if );cf (cf k) )... 阅读全文

摘要： #lang racket(define tolerance 0.00001);公差(define (fixed-point f first-guess) (define (close-enough? v1 v2) (< (abs (- v1 v2)) tolerance) );clos... 阅读全文

摘要： #lang racket;product doing the multiplation(define (product term a next b) (if (< b a) 1 (* (term a) (product term (next a) next b)) ... 阅读全文

摘要： 使用simpson公式求积分#lang racket;this function is use recursive(define (sum term a next b) (if (> a b) 0 (+ (term a) (sum term (next a) next... 阅读全文

摘要： #lang racket(define (fib n) (fib-iter 1 0 0 1 n) );fib(define (fib-iter a b p q count) (cond ((= count 0) b);0 ((even? count) (fib-iter a ... 阅读全文

摘要： #lang racket(define (fast-multiplication a b n);a*n (cond ((= n 0) b);n==0 ((even? n) (fast-multiplication (double a) b ... 阅读全文