Lecture 10 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie explains procedural recursion and introduces permute code. She goes through another example of recursive code line by line, explaining each component. Recursive backtracking and it's usefulness are discussed. The example of placing several queen chess pieces on a board where none of them can attack the other is then demonstrated.
Complete Playlist for the Course:
http://www.youtube.com/view_play_list?p=FE6E58F856038C69
CS 106B Course Website:
http://cs106b.stanford.edu
Stanford Center for Professional Development:
http://scpd.stanford.edu/
Stanford University:
http://www.stanford.edu/
Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/
