Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library


Library Home || Full Table of Contents || Suggest a Link || Library Help

Visit this site: http://www.nuigalway.ie/mat/algorithms/

Author:National University of Ireland
Description: 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
Languages: English
Resource Types: Web Interactive/Java
Math Topics: Factors, Golden Ratio/Fibonacci, Algorithms, Operations Research

[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help

© 1994- The Math Forum at NCTM. All rights reserved.