| | |
Description
| | 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:http://www.youtube.com/view_play_list?p=FE6E58F856038C69CS 106B Course Website:http://cs106b.stanford.eduStanford Center for Professional Development:http://scpd.stanford.edu/Stanford University:http://www.stanford.edu/Stanford University Channel on YouTube:http://www.youtube.com/stanforduniversity/ |
| | Search Keyword | | | Video Linkīs | | | | Random selected Media | | | Right Box | | | |
All times are GMT +1. The time now is 11:47 PM.
It seems that you are unregistered. Please register with us by clicking Here, or if you are already registered login here
Home
Blogs
Books
Games
Photos
Albums
Video
Import
Invite
Tags
Survey
Awards
Tutorials
Rules
--- 
Views: 11 
Votes: 0 
Rating: 0.00 
id: #2855
| 
