aboutsummaryrefslogtreecommitdiff
path: root/chap1/part1.rkt
blob: 78c77686630ad36d213eac477a042b2e6e61de94 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
#lang sicp

;; Chapter 1
;; Building Abstractions with Procedures

;; 1.1
;; The Elements of Programming

#| 1.1 |#

#| 10 |#
#| 10 |#

#| (+ 5 3 4) |#
#| 12 |#

#| (- 9 1) |#
#| 8 |#

#| (/ 6 2) |#
#| 3 |#

#| (+ (* 2 4) (- 4 6)) |#
#| 6 |#

#| (define a 3) |#
#| () |#

#| (define b (+ a 1)) |#
#| () |#

#| (+ a b (* a b)) |#
#| 19 |#

#| (= a b) |#
#| #f |#

#| (if |#
#|   (and (> b a) (< b (* a b))) |#
#|   b |#
#|   a) |#
#| 4 |#

#| (cond |#
#|   ((= a 4) 6) |#
#|   ((= b 4) (+ 6 7 a)) |#
#|   (else 25)) |#
#| 16 |#

#| (+ 2 (if (> b a) b a)) |#
#| 6 |#

#| (* |#
#|   (cond |#
#|     ((> a b) a) |#
#|     ((< a b) b) |#
#|     (else -1)) |#
#|   (+ a 1)) |#
#| 16 |#

#| 1.2 |#

(/
  (+ 5 4 (- 2 (- 3 (+ 6 (/ 4 5)))))
  (* 3 (- 6 2) (- 2 7)))


(#%provide square)
(define (square x) (* x x))
(define (sum-of-squares x y) (+ (square x) (square y)))

#| 1.3 |#

(#%provide sos-two-larger)
(define (sos-two-larger a b c)
  (if (> a b)
    (sum-of-squares a (if (> b c) b c))
    (sum-of-squares b (if (> a c) a c))))

#| 1.4 |#

(#%provide a-plus-abs-b)
(define (a-plus-abs-b a b)
  ((if (> b 0) + -) a b))

#| 1.5 |#

(#%provide p)
(#%provide test)
(define (p) (p))
(define (test x y)
  (if (= x 0)
    0
    y))

#| Applicative order: this will loop forever |#
#| Normal order: this will terminate after one call to test |#

#| (test 0 (p)) |#


(define (average x y)
  (/ (+ x y) 2))

(#%provide sqrt-)
(define (sqrt- x)
  (define (good-enough? guess)
    (< (abs (- (square guess) x)) 0.001))
  (define (improve guess)
    (average guess (/ x guess)))
  (define (sqrt-iter guess)
    (if (good-enough? guess)
      guess
      (sqrt-iter (improve guess))))
  (sqrt-iter 1.0))

#| 1.6 |#

(define (new-if pred then-clause else-clause)
  (cond
    (pred then-clause)
    (else else-clause)))

(#%provide sqrt-new)
(define (sqrt-new x)
  (define (good-enough? guess)
    (< (abs (- (square guess) x)) 0.001))
  (define (improve guess)
    (average guess (/ x guess)))
  (define (sqrt-iter guess)
    (new-if (good-enough? guess)
      guess
      (sqrt-iter (improve guess))))
  (sqrt-iter 1.0))

#| 1.7 |#

(#%provide sqrt-delt)
(define (sqrt-delt x)
  (define (good-enough? last-guess guess)
    (< (/ (abs (- last-guess guess)) x) 0.000000000001))
  (define (improve guess)
    (average guess (/ x guess)))
  (define (sqrt-iter last-guess guess)
    (if (good-enough? last-guess guess)
      guess
      (sqrt-iter guess (improve guess))))
  (sqrt-iter 1.0 (improve 1.0)))

(square (sqrt-delt 479800023432748679))
(square (sqrt-delt 0.00000024353))

#| 1.8 |#

(#%provide cube)
(define (cube x) (* x x x))

(#%provide cbrt)
(define (cbrt x)
  (define (good-enough? guess)
    (< (abs (- (cube guess) x)) 0.001))
  (define (improve y)
    (/ (+ (/ x (square y)) (* 2 y)) 3))
  (define (cbrt-iter guess)
    (if (good-enough? guess)
      guess
      (cbrt-iter (improve guess))))
  (cbrt-iter 1.0))