Lecture 11: Backtracking Pseudocode
author: Julie Zelenski,
Computer Science Department, Stanford University
published: Nov. 15, 2010, recorded: January 2008, views: 3602
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: Nov. 15, 2010, recorded: January 2008, views: 3602
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
And so the material at this point jumps around a little bit, right? We go back and pick up some of the pointers in array information that was in earlier chapters. Linked lists are covered a little bit later in kind of a different context that is – you can do but it’s not the best match to how we’re covering it here. And then handout 21, which I gave out today, is more similar to the way I’m going to be showing you linked lists and its concepts. ...
See the whole transcript at Programming Abstractions - Lecture 11
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: