Library Home || Full Table of Contents || Library Help
|National University of Ireland|
|Web interfaces that provide steps for moving the disks of the Towers of Hanoi, calculate the Euclidean greatest common divisor (GCD) algorithm using recursion, and compute maximum profit from the knapsack problem using dynamic programming. Also, generate Fibonacci numbers by recursion, by iteration, or binary (log2(n)) iteration.|
|Levels:||High School (9-12), College|
|Resource Types:||Web Interactive/Java|
|Math Topics:||Factors, Golden Ratio/Fibonacci, Algorithms, Operations Research|
© 1994- The Math Forum at NCTM. All rights reserved.