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: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com
Lexicon is mentioned in this lecture, but details in lecture 25.
Great lectures 9 , 10 on recursion, backtracking.
In what lecture is she handling Lexicon?
Very tricky subject this is really hard to get those 4 lines do something that amazing
I assume this a hard subject when you first bumped, maybe in a while I will get this but now I see it very hard to word my mind extrapolating this in a code, but I agree is something you have to master is a must really powerful.
Goin’ nowhere fast!