Lecture 10 | Programming Abstractions (Stanford)
111.8 هزار بار بازدید -
16 سال پیش
-
Lecture 10 by Julie Zelenski
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...
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:
stanforduniversity
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...
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:
stanforduniversity
16 سال پیش
در تاریخ 1387/04/26 منتشر شده
است.
111,897
بـار بازدید شده