;; Define intersection-tco-help ;; Given two sets and an empty set return the set of all shared elements ;; Order does not matter in this but having duplicate elements is incorrect ;; rv should be the running set of elements that are being kept ;; ;; (intersection-tco '(1 3 5) '(1 2 3 4 5)) => '(1 3 5) ;; (intersection-tco '(1 2 3) '(4 5 6)) => '() ;; (intersection-tco '() '(1)) => '()

(define (intersection-tco-help s t rv) )

(define (intersection-tco s t) (intersection-tco-help s t '()))