Dynamic programming and branch and bound algorithm animations using a PEAV format
Chuck Leska · Journal of computing sciences in colleges · 2011
This paper reports on a collection of algorithm animations of dynamic programming and branch-and-bound problems developed in JHave. After a discussion on how these algorithm animations meet the criteria for a pedagogically effective algorithm visualization (PEAV), it presents the collection of algorithms available and for each type an example is used to illustrate the materials available and their potential. The paper also describes their use in two courses and together with observations about their effectiveness.