Can You Beat the Sorter?
Help
1
2
3
4
5
6
7
8
9
10
Human sorting list
Not Sorted
0 seconds
1
2
3
4
5
6
7
8
9
10
Robot sorting list
A very slow sorting algorithm. This compares 2 adjectent numbers and swaps them if they are in the wrong order. It has O(n^2) steps
This is "Can You Beat the Sorter?", a game I made to teach my brother about dif ferent sorting algorithms. In this game, you choose a sorting algorithm and a difficulty to face off agaisnt. After pressing the green start button, you must sort the red list before the sorting algortihm of your choice sorts the blue list. Hopefully this game teaches you about the exciting field of sorting algorithms.