Algorithm animation has a long history in CS education, and in this paper we describe a novel way to animate basic sorting routines. The idea is to scramble the pixels of a picture, and then use a sorting routine to unscramble them. The resulting animation of moving pixels is both enjoyable to watch, and provides enough clues to figure out what algorithm is doing the unscrambling. We have used this as a class activity in numerous data structures and algorithms courses to test students understanding of different sorting algorithms. In addition to describing how our animation technique works and is implemented we also discuss some of the related work in the field of algorithm visualization, and the importance of student engagement in such visualizations.
Unfortunately, ACM prohibits us from displaying non-influential references for this paper.
To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=1536285.