SICP Exercise 2.65 union-set and intersection-set

Exercise 2.65.  Use the results of exercises 2.63 and  2.64 to give (n) implementations of union-set and intersection-set for sets implemented as (balanced) binary trees.41

 SOLUTION

 The code and tests are here.

Comments

Post a Comment

Popular posts from this blog

SICP Exercise 4.9 do for while until

Exercise 4.9.    Many languages support a variety of iteration constructs, such as  do ,  for ,  while , and  until . In Scheme, iterative processes can be expressed in terms of ordinary procedure calls, so special iteration constructs provide no essential gain in computational power. On the other hand, such constructs are often convenient. Design some iteration constructs, give examples of their use, and show how to implement them as derived expressions. SOLUTION The code and tests are  here . I have implemented the following expressions: do-while do-until for while The 'do-while' construct can be as follows: (do   (<one or more statements>)   while (condition) ) Use the while block construct to convert it as follows: (begin   <statements>   (while (condition)   <statements>   ) ) The 'do-until' construct can be as follows: (do   (<one or more statements>) ...
Read more

SICP Exercise 3.56 merge streams

Exercise 3.56.   A famous problem, first raised by  R. Hamming, is to enumerate, in ascending order with no repetitions, all positive integers with no prime factors other than 2, 3, or 5. One obvious way to do this is to simply test each integer in turn to see whether it has any factors other than 2, 3, and 5. But this is very inefficient, since, as the integers get larger, fewer and fewer of them fit the requirement. As an alternative, let us call the required stream of numbers  S  and notice the following facts about it. S  begins with 1. The elements of  (scale-stream S 2)  are also elements of  S . The same is true for  (scale-stream S 3)  and  (scale-stream 5 S) . These are all the elements of  S . Now all we have to do is combine elements from these sources. For this we define a procedure  merge  that combines two ordered streams into one ordered result stream, eliminating repetitions: (define...
Read more

SICP Exercise 2.49 segments-painter

Image
Exercise 2.49.   Use  segments->painter  to define the following primitive painters: a.  The painter that draws the outline of the designated frame. b.  The painter that draws an ``X'' by connecting opposite corners of the frame. c.  The painter that draws a diamond shape by connecting the midpoints of the sides of the frame. d.  The  wave  painter. SOLUTION The code and tests are here . Note: The implementation of the procedure segments->painter in the textbook  is different from the similarly named procedure in the sicp plt package. The plt package procedure takes a list of segments and draws them. Moreover,  this procedure draws segments only inside the unit square where 0 <= x,y <= 1. Any  points ouside the unit square are simply ignored (at least, there is no visual  output) The textbook implementation also takes a list of segments but instead of drawing them...
Read more