CS 106B Lecture Notes - Lecture 10: Super Slow, Backtracking, Empty String
19 Oct 2016
School
Department
Course
Professor
Document Summary
Announcements: yeah hours for metaacademy today! 7-8pm, 420-041: all midterm accommodations must be reported by friday at noon. Midterm is thursday, november 3rd, at 7pm: two chris" went to cs faculty retreat last weekend. Googleq based on an advanced development of fauxtoshop: stanford professor (emeritus) mark levoy gave talk about research at. Continue function allows code to skip current function: permutations. Do not lend well to iterative looping; not iterative in nature. We can use a recursive method called an exhaustive algorithm. If you have no more characters left to rearrange, print current permutation. Call a helper function that passes in more parameters and. Maze solving when it goes in the wrong direction and has to backtrack. There will be review, but start studying soon: all midterm accommodations must be reported by friday at noon, tiny feedback feedback. Lot of people want more code written in class. This will be at expense of actual material.
