CS241: Topics for the Week of October 29, 2007

• Reading: finish Chp 8 & Chp 9
• Monday - continue going over Lab 7: Complexity and Simple Sorts
• Monday - discuss Lab 8: Recursion and Divide-and-Conquer Sorting

• Determining complexity empirically.

• Continue discussion of recursion and induction:

  • Mathematical Induction
  • Pitfalls: All sheep are the same color.
  • Simple recursion examples: printing a list, summations, factorials, towers of hanoi, turtle graphics, permutations, powers of 2.
  • What happens to the Java Call stack.
  • Sorting examples: Mergesort, quicksort, stooge. complexity
  • Dynamic programming - fibonacci
  • Recursion vs iteration.
  • Linked lists using recursion.