Lecture 22: Writing a Recursive Power Set Function in Scheme

The first one I want to do is actually more of a discreet math problem than it is a scheme problem, but we’re gonna drive the problem using scheme. It deals with the notion of what is called a power set and those in 103a and 103b over the past year are very familiar with the power sets. The loose definition of a power set is that it is a set that contains all of a sets subsets. So if we talk about the original set just {1,2,3}, but you know what, I’m not gonna draw it that way because we’re not gonna draw it that way in scheme. ... See the whole transcript at [[http://see.stanford.edu/materials/icsppcs107/transcripts/ProgrammingParadigms-Lecture22.pdf|Programming Paradigms - Lecture 22]]