Skip to Content

Library for Animated Sort Algorithms

A new way of understanding CS algorithms by constructing them.

Understanding basic CS algorithms is not as easy as it could.

To overcome this difficulty a lot of tools have been developed to allow students to actually see how the algorithms work. Very nice animations are now available, but they lack something: interaction, explanation, construction. The students can look at the animation, but very often they don't see what is the link between the algorithm's instructions and the animation. Most importantly, students cannot act on the algorithm by modifying it, or, even better, by actually constructing it.

To this purpose I developed a Scratch "library" to create sort algorithms (basic sort, bubble sort, etc) so that  students can design their own algorithm and actually see how it works (http://scratch.mit.edu/projects/s_federici/1364719). The library is based on highlevel instructions (comparison, swap, etc) but other levels can be developed.

The original project was deveoped with BYOB (http://byob.berkeley.edu/). The BYOB version (available at http://www.sitibs.com/branches/moodle/mod/forum/view.php?id=6318) is much cleaner, as BYOB also allows you to create new loops and blocks.