CS 342 Lecture -*- Outline -*- * examples TA has worked examples from p. 71ff: reversal, even-sum, not= ** find-closest see find on page 72 does it work if v is a matrix? work problem 2 on page 88 (define find0 (x v) ([] (cat (compress (= x v) (indx (shape v))) 0) 1)) what is the set used for in find-closest? ** histogram they should study it ** limitations binomial coefficients example why do you have to use a loop?