Towards the identification of graphical principles for visualizing algorithm design techniques

Up to our knowledge, the literature does not describe clear principles for the design of algorithm visualizations with educational purposes. In order to fill this gap, we have conducted a study on the features of illustrations found in prestigious algorithm textbooks. In this paper, we describe the methodology followed for our analysis and the results obtained, both general and specific of three basic algorithm design techniques (divide and conquer, backtracking, and dynamic programming). The results vary, sometimes being unexpected, and allow sketching design principles for the visualization of algorithms.