Once the project is compiled and the binary is ran, one can start/pause the sort by pressing space. Once the sorting complete, or interrupted, one can regenerate and reshuffle the array by pressing r.
- This piece of code depends on the SFML libraries, in particular their graphics and audio components.
- It also depends on CMake to compile and build.
- Clone the repo
git clone https://github.com/golfrumors/sorting-visualizer- Cd into the appropriate folder
cd sorting-visualizer- Tweak settings as needed
- In the root directory, create a new folder to hold the executable
mkdir build && cd build- Compile the project using CMake
cmake .. && cmake --build .- Run the executable
./SortingVisualizer- Add delays to individual sorting aglorithms
- Make the access & comparisons text look better
- Fix colors/visualizations for some algorithms, as they aren't very visual
- Add terrible algorithms
- Implement C++ default sorts (std::sort & std::stable_sort)
- Make bucket sort more visual
- Implement Bingo Sort Algorithm
- Implement Strand Sort
- Fix Strand Sort
- Implement Bitonic Sort
- Fix Bitonic Sort
- Fix Shell Sort, as for now it keeps comparing the array forever and never flags it as being done properly
- Implement Pancake sorting
- Implement BogoSort or Permutation Sort
- Implement Gnome Sort
- Implement Stooge Sort
- I know it's super slow by design, but this is disgusting, rewowrk it
- Implement Tag Sort (To get both sorted and original)
- Implement Tree Sort
- Implement Odd-Even Sort / Brick Sort
- Implement 3-way Merge Sort