✳flâneur — a map of the web's best reading

CS106B Recursive Backtracking and Enumeration

web.stanford.edu · 5,424 words · saved by 1 readers

We will be further exploring recursive backtracking in order to solve more difficult problems that cannot be easily solved with iterative approaches. Lecture Video Prezi Here are the Prezis from today's lecture: Contents 1. Summary and Context: Sequences, Permutations, and Subsets 2. Introduction to Recursive Backtracking 3. Fundamental Backtracking Paradigm: "Choose, Explore, Unchoose" 4. The Basic Anatomy of a Backtracking Algorithm (A Bit More Detail) 5. Generating Subsets with Recursive Backtracking 6. Side Note Regarding the Efficiency of printSubsets() 7. Modifying printSubsets()to Return the Number of Subsets Generated 8. Partitioning with Recursive Backtracking 9. Modified isPartitionable() Function: Tracking our Vector Contents 10. Early Termination in the isPartitionable() Function 11. Side Note: Returning Conditional Expressions from Boolean Functions 12. Side Note: Short-Circuiting 13. What's next? 14. Exam Prep Summary and Context: Sequences, Permutations, and Subsets

CS106B Recursive Backtracking and Enumeration Recursive Backtracking and Enumeration Thursday, July 9 We will be further exploring recursive backtracking in order to solve more difficult problems that cannot be easily solved with iterative approaches. 📚 Readings: Text 9.1-9.3 📝 Lecture quiz on Canvas Prezi Here are the Prezis from today's lecture: Contents 1. Summary and Context: Sequences, Permutations, and Subsets 2. Introduction to Recursive Backtracking 3. Fundamental Backtracking Paradigm: "Choose, Explore, Unchoose" 4. The Basic Anatomy of a Backtracking Algorithm (A Bit More Detail) 5

Explore this link on the map →

related reading