Learning Outcome

At the end of this lesson, you will be able to:

• understand and use Recursion

Silent Watching

• watch this video

Review

• review "Recursion"

Lesson

• go over "Procedures & Functions", Chapter 4
  • Computer Based Problem Solving
  • read "Recursion"

Activity

• go here and play the "Towers of Hanoi" game
• good explanation of algorithm: https://www.khanacademy.org/computing/computer-science/algorithms/towers-of-hanoi/a/towers-of-hanoi
• Python example code: http://interactivepython.org/runestone/static/pythonds/Recursion/TowerofHanoi.html

Daily Assignment

• the Towers of Hanio is one of the most famous recursive algorithm that you will see in computer science (meaning you will see it next year!)
  • here is the Wikipedia entry (including solution)
  • create a program that does the "Towers of Hanoi"
    • it can just be text based (although graphical would be really cool!)
    • this will take several days to complete

Object-Orient Analysis & Design

• read over and do Lesson 11

Extra

• work on weekly assignment