Back to comment hit list
Back to comment hit list
Search all MERLOT
Select to go to your profile
Select to go to your workspace
Select to go to your Dashboard Report
Select to go to your Content Builder
Select to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II

Advanced Search

    

Comment


Material:

Towers of Hanoi

Rating: 4 stars
Used in Course: Not used in course
Submitted by: Audrone Matutis (Faculty), Nov 09, 2006
Comment: A great visual aid for teaching how to develop an algorithm to programatically solve this classic recursive function problem.

Technical Remarks:

The page has been moved. It's new location is: www.cut-the-knot.org/recurrence/hanoi.shtml