Learning Recursion with RUR-PLE

Posted in Development on December 20, 2006


Learning Recursion with RUR-PLE
In this ShowMeDo, André Roberge discusses the concept of recursion, starting from the simplest example and ending with a graphical solution of the Tower of Hanoi puzzle using RUR-PLE. The importance of ensuring a proper termination condition and the pitfalls associated with an overly large number of function calls in generating Fibonacci numbers are also covered, as is the topic of memoization.

Watch Video

Tags: Python, ShowMeDo