A Design of Automatic Visualizations for Divide-and-Conquer Algorithms

The paper addresses the design of program visualizations adequate to represent divide-and-conquer algorithms. Firstly, we present the results of several surveys performed on the visualization of divide-and-conquer algorithms in the literature. Secondly, we make a proposal for three complementary, co...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science 2009-01, Vol.224, p.159-167
Main Authors: Velázquez-Iturbide, J. Ángel, Pérez-Carrasco, Antonio, Urquiza-Fuentes, Jaime
Format: Article
Language:English
Subjects:
activation tree
amimation
data structure
divide-and-conquer
visualization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper addresses the design of program visualizations adequate to represent divide-and-conquer algorithms. Firstly, we present the results of several surveys performed on the visualization of divide-and-conquer algorithms in the literature. Secondly, we make a proposal for three complementary, coordinated views of these algorithms. In summary, they are based an animation of the activation tree, an animation of the data structure, and a sequence of visualizations of the substructures, respectively.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2008.12.060