Recommendation: Unrated.
Description: The example describes the Unbounded Knapsack problem - an example of Dynamic Programming. The user is able to define the total volume of the knapsack and all the values and volumes of items of which to select things inside knapsack. The applet will then show the optimal solution.
Evaluation: The problem is well described and thus the user knows what to do. The formal definition of the algorithm doing the solution is also described lower in the page. The given visualization example does not however visualize the run of the algorithm, but only runs the algorithm through showing the optimal solution. The main point is that the user is able to define the input for the algorithm (the volumes and values of the items). As the use is then based only on the 'Solve' button and a given optimal solution, the user can easily just start 'playing' with different inputs without focusing at all on one run. What is good, is that the calculations of the algorithm are shown below, but in a too small text area that is too easily left hidden. This is an interesting applet, a 'nice to play with', but should really visualize the run of the algorithm with the ability for the user to control the run (step-by-step) in order to actually help the learning experience.