Unit #3-04

Learning Outcome

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

• understand and use recursion

  • Towers of Hanoi

Review

• what is a recursion

  • a function that calls itself

Lesson

• read "Functions", Chapter 3, Computer Based Problem Solving

  • read "Recursion"

Activity

• go here and play the "Towers of Hanoi" game

• here is a really good video explaining each step

• 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

• here is my example as well:

  • https://github.com/Mr-Coxall/ICS4U-Unit3-04-Python-Towers_of_Hanoi

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 will just be text based (although graphical would be really cool!)

• starter code here: https://github.com/Mr-Coxall/TowersOfHanoi-Starter

Extra

• do the above in a second language