This project is an interactive sorting algorithm visualizer built with Python. It helps you understand how different sorting algorithms work by displaying their operations step by step in a clear and visual manner.
-
Visualizes popular sorting algorithms:
Bubble Sort
Selection Sort
Insertion Sort
Quick Sort
-
Real-time animation of the sorting process.
-
Easy-to-use GUI with simple controls.
-
Python 3.7+
-
matplotlib, TKinter
git clone https://github.com/nevsky-dev/simple-sorting-visualizer.git
cd simple-sorting-visualizer
pip install -r requirements.txt
Run the visualizer with:
python main.py
-
Select the sorting algorithm you want to visualize.
-
Press Start to watch the sorting process step by step.
-
The visualizer is designed for educational purposes and may not be optimized for very large arrays.
-
Animation speed may vary depending on system performance.
-
Some algorithms (like Quick Sort or Bubble Sort) may appear faster or slower due to the nature of their operations and how the animation is rendered.
-
It is very simple, made only for educational purposes
-
Only numeric arrays are supported.
-
Quick Sort shows comparisons and swaps but does not highlight the pivot separately.
This project is licensed under the MIT License. You are free to:
-
Use, copy, modify, and distribute the software.
-
Include it in your own projects (personal or commercial).
-
Thanks to Python, Tkinter and Matplotlib documentation for providing the tools to create this tool.
-
Inspired by various algorithm visualization projects online.