This project provides a dynamic and interactive way to understand and visualize the inner workings of popular sorting algorithms. Sorting algorithms are fundamental in computer science, and visualizations make it easier to grasp their behavior and efficiency.
The visualization is built using C++ with the help of libraries such as:
- SFML: For graphical visualizations.
- thread: Every visualization is run on it's own thread.
The program takes a random data set as input and dynamically visualizes the sorting process, providing insights into number of swaps and comparisons.
Watch the video below for a demonstration of how the visualization works:
demonstration.mp4
- Bubble Sort
- Insertion Sort
- Quick Sort
- Heap Sort
- Bogo Sort
- Merge Sort
- Comb Sort
- Shell Sort
- Dumb Sort