Home > Lectures > Thinking Recursively

Thinking Recursively

By Julie Zelenski - Stanford
get flash player

Lecture Description

Thinking Recursively, Procedural vs Functional Recursion, Fractal Code, Live Demo: Fractal Example, Another Recursive Graphic: Mondrian Art, Random Pseudo-Mondrian and the Code, Hanois Towers : Classic Recursion Example, Tower Code, Live Demo, Permutations, Permute Code, Tree of Recursive Calls

Course Description

Related Resources

Transcript

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. Selection Sort
  15. Partitioning for Quicksort
  16. Sort Template with Callback
  17. Abstract Data Types
  18. Rules of Template Implementation
  19. Live Coding: Recap of the Vector-based Implementation for Stack
  20. Buffer: Vector vs Stack
  21. Map as Vector
  22. Pathfinder Demo
  23. Compare Map Implementations
  24. Lexicon Case Study
  25. Final Showdown
  26. About the C++ Language, Quick History of C++, C++ Philosophy