A lightweight sorting visualizer made with C++ and SFML.
 |
|---|
| Quick sort |
 |
|---|
| Bubble sort |
 |
|---|
| Bubble sort info |
Awesome! Here you can find some useful info about the visualizer, we accept first contributors too!
Also, make sure to pull the last changes from dev branch!
- Bubble sort
- Bubble sort works by continuously swapping elements next to each other that are in the wrong place. Starting from the beginning of the dataset, each element 'floats' to its correct spot. More on Bubble sort can be found here.
- Selection sort
- Selection sort works by having two sections, the sorted and unsorted sections, and continuously search through the unsorted section and place the smallest element into the sorted section. This sorting algorithm could be implemented where the largest element is selected instead. More on selection sort can be found here.
- Insertion sort
- Insertion sort is similar to selection sort in that they both have a sorted and unsorted section. Instead of continuously selected the smallest/largest element, it will insert a selected element from the unsorted portion and 'insert' it into the correct spot in the sorted section. More on insertion sort can be found here.
- Quick sort
- Quick sort is a "Divide and Conquer" algorithm. Divide and Conquer algorithms work by splitting the problem into smaller portions, solving the smaller problems, then combing the solutions into one final solution. Quick sort works by choosing an element as a 'pivot', moving the other elements around where elements less than the pivot are on one side and elements greater than the pivot are on the other, then continuously doing that process with each side. Once each element has been partitioned, the solution is combined into the sorted array. More on quick sort can be found here and more on Divide and Conquer algorithms can be found here.
- Cocktail shaker sort
- Cocktail shaker sort is a variant of Bubble Sort. Instead of only having elements 'float' from the bottom to its correct spot in the dataset, elements also 'sink' from the top of the datset into its correct position. More on cocktail shaker sort can be found here.
- Bogo sort
- Bogo sort is an inefficient sorting algorithm where it randomly generates different versions of the original dataset and checks if it's sorted or not. More on bogo sort can be found here.
- Bitonic sort
- Bitonic sort is a comparison based sorting algorithm that can be run with parallel implementation. Within different subarrays, the algorithm checks if the first element is smaller than the second and vice versa. It continuously does that on larger subarrays until the whole dataset is sorted. More on bitonic sort can be found here.
- Space: Start sort
- Backspace: Stop sort
- h: Display help
- F1: Change number of elements
- F2: Change time between comparisons
- Arrow Up / Arrow down: Change sort type
Requirements:
- CMake
- Clone the project:
git clone https://github.com/alesbe/sorting-visualizer && cd sorting-visualizer - Run
./install.sh
If you want to compile the project by yourself you need to follow the next steps:
- Download SFML from the official website
- Download CMake
- Clone the repository
- Open
CMakeLists.txtand locate the variableSFML_DIR. Set the path to the route where the SFML CMake files are located. For instanceC:/Program Files (x86)/SFML/lib/cmake/SFML. - From the root directory of the repository, run:
mkdir build cd build
cmake ..
cmake -G 'Visual Studio 17 2022' ..
- In the
/builddirectory should be a Visual Studio solution. Now you can open the solution and compile the file with the play button as usual!
Note: If you don't want to use Visual Studio 2022, download SFML for your target compiler and change the cmake generator in step 6. You can check the list of generators with cmake -G