Welcome to Sorter! This is my Python implementation of a sorting algorithm visualizer. The program can be exucted simply with:
python3 sorter.py
This will open up the GUI for Sorter, implemented using pygame.
In depth training documentation is provided by the Mini Manual file in this repo.
On the top bar of the GUI you will find buttons to:
- Halve the number of elements to sort
- Double the number of elements to sort
- Reset (scramble) the bars to sort. This also halts any in-progress sort
- Execute quick sort
- Execute heap sort
- Execute merge sort
- Execute bubble sort
All algorithms have been implemented as in-place so that the bars may update as the sorting is occurring. There will be a programmed delay between each swapping/moving of the elements in the array, and this delay is scaled with how many bars are on the screen. This is done such that the less bars you have on the screen, the slower the bars are moved, and vice versa. This way sorting many bars does not take too long meanwhile sorting few bars provides a clear execution procedure.
Thank you for reading and I hope you enjoy using the application! Sean O'Beirne