Computer Science 15-100, Fall 2008
Class Notes:  Getting Started With Recursion

Getting Started With Recursion

1. Recursion:  base case + recursive case
2. Examples:  pascalsTriangle(row, col), fib(n)
3. Memoization (Making recursive fib(n) tractable)
4. Case studies:
   1. Knight's Tour
   2. Eight Queens
   3. Mazes
   4. Base-N Counting
   5. Flood Fill
   6. Quicksort
   7. Mergesort

carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem