Comic Strips for Algorithm Visualization
Henning Biermann, Richard Cole
Courant Institute of Mathematical Sciences
New York University
February, 1999
Abstract
This paper presents visualizations of binary search trees and
splay trees. The visualization comprise sequences of figures or
frames, called comic strips. Consecutive frames are viewed
two at a time to facilitate user (viewer) understanding of the
algorithm steps.
The visualizations are implemented in Java to facilitate their
wide use. This paper explores several other considerations in the
design of instructional visualizations.
This work was supported in part by NSF grants CCR-9503309
and CCR-9800085.
Selected References:
-
Ronald M. Backer and David Sherman.
Sorting out sorting, 16mm color sound film, 30 minutes, 1981.
Shown at ACM SIGGRAPH '81 in Dallas, TX and excerpted in ACM SIGGRAPH
Video Review \# 7, 1982.
-
M. H. Brown. Algorithm Animation.
ACM Distinguished Dissertation. MIT Press, Cambridge, MA 1987
-
JohnT. Stasko.
Tango: A framework and system for algorithm animation.
Computer, 23(9):27--39, September 1990.
Download postscript file.
View tree visualization.
Algorithm Visualization Homepage