This project visualizes the sorting of colors using various sorting algorithms. The workloads are also multithreaded so you can see the algorithm working in multiple lines (Multi-Algorithm Searching visualizes the differences pretty nicely). So far the algorithms implemented are Insertion, Selection, Bubble, Merge, Quick, Bucket, and Radix Sorts. (Multi Algorithm Sorting uses the algorithms in this order: Bubble, Insertion, Merge, Selection)
You must have a python environment with PyGame and the NumPy modules.
This install line should do the trick: pip install pygame numpy
After that you can just run the main.py file and get started
Randomize the colors - F5
Start Algorithm - Return or Enter
Change Algorithm - Left/Right Arrow Keys
Change Increment Size - Up/Down Arrow Keys
Toggle step timer (Fast Step): s
- The algorithm times are relatively inaccurate. Selection sort is blazingly fast (Probably because it doesn't require copying as much data) while the other sorts seem slow in comparison. I need to find a way to accurately represent each algorithm's strengths
- Add Play/Pausing (Probably not going to happen atm b/c requires complete rewrite)
- More Algorithms
- Vel0ciTy - Main Author
- StackOverflow 😀
- Geeks for Geeks Huge help with learning about and visualizing the algorithms. The difference in data structures made it difficult to implement the algorithms at first but this site made it really easy to learn