Recommendation

Has Potential

Link

http://www.cs.usfca.edu/galles/visualization/download.html

Delivery Method

Java Application

License

Unlicensed Sourcecode

Language

English

Author

David Galles

Institution

University of San Francisco

Project

Data Structure Visualization

RelationshipToProject

PartOfProject

Works

Yes

Description

Demonstrations for two different simple dynamic programming examples: Fibonacci series and making change. For each one, there are three versions: Making a full table from the bottom up; using "memoized" recursive calls where the auxiliary table avoids duplicate calls; and a naive recursive implementation without dynamic programming.

Evaluation

Helpful AV for getting started with dynamic programming, though this could be much better. There is no explanation for what is going on as the algorithm progresses. Seeing the pseudocode does help here. The change example suffers greatly from the fact that it is not at all clear what is going on -- what are the sizes of the coins? The values in the table don't really make sense. Having the three versions of the algorithm does help to illustrate why dynamic programming can be effective. It would be nice to get some sort of performance statistics, or watch them side-by-side for better comparison.

ActivityLevel

Animation; Step Control; User Data

GoodFor

Lecture Aid; Self Study

Screenshots

Videos

References

HowToUse

First Visited

2006-09-01

Last Visited

2008-07-02

Last Updated

2006-04-05

Topic

DynamicProgramming

Community

Edit

You may edit this entry if you have an account.