Using cumulative graphic traces in the visualization of sorting algorithms

ABSTRACT

Some instructionally oriented graphic displays of algorithm execution can be enhanced by the use of a cumulative graphic trace, which presents a stylized visual representation of the history of the algorithm's operation on a data structure. This graphic trace can convey information about the order in which operations were done or elements were processed, information which is often not available in dynamic displays of algorithm execution. It can also in some cases serve as in "icon" to help students remember the algorithm or contrast it with similar algorithms. The use of cumulative graphic traces in the study of various sorting algorithms is illustrated.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

Additional Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS

General Terms:
Algorithms, Design