Recursion

Thinking recursively

5.1.1 Identify a situation that requires the use of recursive thinking

Suggested practical activity: snowflakes and fractals, towers of Hanoi.

Some python examples

• Recursive and non recusive fibonacci series generator

• Recursive geomeric series summation

• Towers of Hanoi [uses pygame module] pygame can be installed as a add-on to python. Currently it is installed on the hockerill desktops and on remote apps.

• Towers of Hanoi [text version]

Pseudocode examples

Link to utah cs page

5.1.2 Identify recursive thinking in a specified problem solution

5.1.3 Trace a recursive algorithm to express a solution to a problem.

Students will be required to state the output of the recursive algorithm.
For example, trees.

Binary trees will be examined at the level of diagrams and descriptions.

This illustration shows how binary tree functions are recursive Binary tree animation (usfca)