my attempt to do the exercises in sicp.

Thursday, July 17, 2008

sicp exercise 2.32

; Exercise 2.32.  We can represent a set as a list of distinct elements, and we can represent the set of all subsets of the set as a list of lists. For example, if the set is (1 2 3), then the set of all subsets is (() (3) (2) (2 3) (1) (1 3) (1 2) (1 2 3)). Complete the following definition of a procedure that generates the set of subsets of a set and give a clear explanation of why it works:

; (define (subsets s)
;   (if (null? s)
;       (list nil)
;       (let ((rest (subsets (cdr s))))
;         (append rest (map <??> rest)))))

(define (map1 op seq)
  (cond ((null? seq) (list))
        (else (cons (op (car seq)) (map op (cdr seq))))))

(define (append1 seq1 seq2)
  (if (null? seq1) seq2
      (cons (car seq1) (append (cdr seq1) seq2))))

(define (subsets s)
  (if (null? s)
      (list (list))
      (let ((rest (subsets (cdr s))))
        (append1 rest (map1 (lambda (x) (if (null? x) (list (car s)) (cons (car s) x))) rest)))))

(display (subsets (list 1 2 3))) (newline)

No comments: