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

  • Authors:
  • J. Ángel Velázquez-Iturbide;Antonio Pérez-Carrasco;Jaime Urquiza-Fuentes

  • Affiliations:
  • Departamento de Lenguajes y Sistemas Informáticos I, Universidad Rey Juan Carlos, Madrid, Spain;Departamento de Lenguajes y Sistemas Informáticos I, Universidad Rey Juan Carlos, Madrid, Spain;Departamento de Lenguajes y Sistemas Informáticos I, Universidad Rey Juan Carlos, Madrid, Spain

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.