Data Sorts provides theory notes and interactive models of four common data sorting routines used in computing: the Bubble Sort, Insertion Sort, Merge Sort and Quicksort.
The models include a delay feature so sorting occurs at a speed to suit the user, or, alternatively, instantaneously. In addition, the element of the Sort that is currently being processed is highlighted, making it easier to see what is going on and to relate it to the algorithm being used. There is an option to switch on a step-by-step explanation of how each algorithm is functioning.
Speed Trials generates a large data set and then allows the user to sort that data using one of the sorting algorithms, timing how long it took. The data can then be returned to its original order, and one of the other sorts used, allowing comparisons to be drawn. Further sets of data can then be generated to substantiate results. Unlike the standalone models, Speed Trials is not deliberately slowed down and has all unnecessary formatting code removed to optimise performance and therefore provide true comparative data.
Alongside the five interactive models are a set of theory notes describing each of the sort algorithms and designed to be read before interacting with the models and to reinforce learning as they are used.
The Bubble Sort Model:
The Insertion Sort Model:
The Merge Sort Model:
The Quicksort Model:
The Sorting Speed Trials:
The application is supported by a comprehensive help file.
Windows only.
For Site Licences, please contact us
