Lecture 22: Writing a Recursive Power Set Function in Scheme
author: Jerry Cain,
Computer Science Department, Stanford University
published: Sept. 7, 2010, recorded: April 2008, views: 5035
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: Sept. 7, 2010, recorded: April 2008, views: 5035
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
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 Programming Paradigms - Lecture 22
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: