Home > Lectures > Lecture Details

Refresh: Permute Code

By Julie Zelenski - Stanford
get flash player

Lecture Description

Refresh: Permute Code, Tree of Recursive Calls, Live Demo: Testing with Different Cases, Eliminating Duplicates, Subsets, Subset Strategy, Subset Code, Tree of RecursiveCalls: Subset, Exhaustive Recursion, Recursive Backtracking, Turning Recursive Permute to Backtracking, Permute -> Anagram Finder Code, Decision Problems: 8 Queens, Extension to N Queens

Course Description

Related Resources

Transcript   |  Rec Backtrack Examples

Course Index

  1. About the Introduction to Computer Science Series at Stanford
  2. Similarity between C++ & Java: - syntax - variable types - operators - control structures
  3. C++ Libraries - Standard Libraries
  4. C++ Console I/O
  5. Client Use of Templates
  6. More Containers
  7. Seeing Functions as Data: Specific Plot Functions
  8. Common Mistakes Stumbled Upon: 'I'terator
  9. Thinking Recursively
  10. Refresh: Permute Code
  11. Backtracking Pseudocode
  12. Pointer Movie
  13. Coding with Linked List
  14. Algorithm Analysis
  15. Selection Sort
  16. Partitioning for Quicksort
  17. Sort Template with Callback
  18. Abstract Data Types
  19. Rules of Template Implementation
  20. Live Coding: Recap of the Vector-based Implementation for Stack
  21. Buffer: Vector vs Stack
  22. Map as Vector
  23. Pathfinder Demo
  24. Compare Map Implementations
  25. Lexicon Case Study
  26. Final Showdown
  27. About the C++ Language, Quick History of C++, C++ Philosophy