Computer Science II: Programming Abstractions: Lecture 11 (Lecture 11 of 27)

See video
Views: 403
Comments ()


Lecture 11 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie continues with recursive backtracking and introduces pointers and recursive data. Following, she focuses on solving the problems rather than the exact code and later uses the example of a program that will solve a Sudoku puzzle. She explains that recognizing and looking for patterns between all of the different recursive examples is an important component to learning recursion. Complete Playlist for the Course: CS 106B Course Website: Stanford Center for Professional Development: Stanford University: Stanford University Channel on YouTube:
  • Recommend Us