-
Notifications
You must be signed in to change notification settings - Fork 15
/
2.65.scm
165 lines (137 loc) · 4.1 KB
/
2.65.scm
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
;; Some helper procedures
(define (cut-left-branch tree)
(make-tree (entry tree)
'()
(right-branch tree)))
(cut-left-branch (list->tree '(1 2 3 4 5))) ; '(3 () (4 () (5 () ())))
(define (cut-right-branch tree)
(make-tree (entry tree)
(left-branch tree)
'()))
(cut-right-branch (list->tree '(1 2 3 4 5))) ; '(3 (1 () (2 () ())) ())
;; Union
(define (union-set-2 tree1 tree2)
(set! counter (add1 counter))
(cond ((empty? tree1) tree2)
((empty? tree2) tree1)
(else
(let ((entry1 (entry tree1))
(entry2 (entry tree2))
(left1 (left-branch tree1))
(left2 (left-branch tree2))
(right1 (right-branch tree1))
(right2 (right-branch tree2)))
(cond ((= entry1 entry2)
(make-tree entry1
(union-set-2 left1 left2)
(union-set-2 right1 right2)))
((< entry1 entry2)
(union-set-2
(make-tree entry2
(union-set-2 (cut-right-branch tree1)
left2)
right2)
right1))
((< entry2 entry1)
(union-set-2
(make-tree entry1
(union-set-2 (cut-right-branch tree2)
left1)
right1)
right2))
(else (error "Should be unreachable place.")))))))
;;Check
(tree->list-1
(union-set-2 '()
(list->tree '(1 2 3)))) ; '(1 2 3)
(tree->list-1
(union-set-2 (list->tree '(1 2 3))
(list->tree '(1 2 3)))) ; '(1 2 3)
(tree->list-1
(union-set-2 (list->tree '(0 2 4))
(list->tree '(1 2 3)))) ; '(0 1 2 3 4)
(tree->list-1
(union-set-2 (list->tree '(-3 0 1))
(list->tree '(4 7 9)))) ; '(-3 0 1 4 7 9)
(list->tree
(tree->list-1
(union-set-2 (list->tree '(2 4 6 8))
(list->tree '(1 3 5)))))
; '(4 (2 (1 () ()) (3 () ())) (6 (5 () ()) (8 () ())))
(list->tree
(tree->list-1
(union-set-2 (list->tree '(2 4))
(list->tree '(1 3))))) ; counter = 28
(list->tree
(tree->list-1
(union-set-2 (list->tree '(2 4 6 8))
(list->tree '(1 3 5 7))))) ; counter = 52
(list->tree
(tree->list-1
(union-set-2 (list->tree '(2 4 6 8 10 12 14 16))
(list->tree '(1 3 5 7 9 11 13 15))))) ; counter = 100
(set! counter 0)
;; Growth of union-set-2 is linear.
;; Intersection
(define (intersection-set-2 tree1 tree2)
(set! counter (add1 counter))
(cond ((or (empty? tree1) (empty? tree2)) empty)
(else
(let ((entry1 (entry tree1))
(entry2 (entry tree2))
(left1 (left-branch tree1))
(left2 (left-branch tree2))
(right1 (right-branch tree1))
(right2 (right-branch tree2)))
(cond ((= entry1 entry2)
(make-tree entry1
(intersection-set-2 left1 left2)
(intersection-set-2 right1 right2)))
((< entry1 entry2)
(union-set-2
(intersection-set-2 (cut-right-branch tree1)
left2)
(intersection-set-2 right1 tree2)))
((< entry2 entry1)
(union-set-2
(intersection-set-2 (cut-right-branch tree2)
left1)
(intersection-set-2 right2 tree1)))
(else (error "Should be unreachable place.")))))))
(tree->list-1
(intersection-set-2 (list->tree '())
(list->tree '()))) ; '()
(tree->list-1
(intersection-set-2 (list->tree '(1 3 5 8 10))
(list->tree '(1 5 6 8 9)))) ; '(1 5 8)
(tree->list-1
(intersection-set-2 (list->tree '(2 4 6 8))
(list->tree '(1 3 5 7)))) ; '()
;; Counting procedure calls
(set! counter 0)
(list->tree
(tree->list-1
(intersection-set-2 (list->tree '(2 4))
(list->tree '(1 3))))) ; counter = 22
(list->tree
(tree->list-1
(intersection-set-2 (list->tree '(2 4 6 8))
(list->tree '(1 3 5 7))))) ; counter = 42
(list->tree
(tree->list-1
(intersection-set-2 (list->tree '(2 4 6 8 10 12 14 16))
(list->tree '(1 3 5 7 9 11 13 15))))) ; counter = 91
(set! counter 0)
(list->tree
(tree->list-1
(intersection-set-2 (list->tree '(1 3))
(list->tree '(1 3))))) ; counter = 25
(list->tree
(tree->list-1
(intersection-set-2 (list->tree '(2 4 6 8))
(list->tree '(2 4 6 8))))) ; counter = 45
(list->tree
(tree->list-1
(intersection-set-2 (list->tree '(1 3 5 7 9 11 13 15))
(list->tree '(1 3 5 7 9 11 13 15))))) ; counter = 85
;; intersection-set-2 also grows linearly.