The idea of this project is to help the user visualise how different sort algorithms actually function, and how the performances of different sorting algorithms change as the length of the array is increased.
The use of this app is fairly straightforward. The user creates an array of a certain length and assigns a sort algorithm.The array is then added to a table on the page. For each array, three buttons are available (except for bogosort). 'Delete Row' removes the row from the table, 'Iterate Array' performs one iteration of the sort algorithm, and 'Timed Solve' performs the algorithm until the array is solved and returns the time taken for the algorithm to finish.
In addition to this the user has the option to iterate all arrays at once. However it should be noted that some of the iterations are more complex than others, and can't necessarily be used to judge which algorithm is most efficient, but instead should be used as a visualization of that sort method.