A Python application that visualizes various sorting algorithms using Tkinter Python libraries. This project provides a visual representation of how different sorting algorithms work, allowing users to observe and analyze their performance.
-
Visualizes popular sorting algorithms, including:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
-
Allows users to customize the input size, delay between each step, and color scheme.
-
Provides step-by-step visualization of the sorting process, making it easy to understand how the algorithms work.
-
Displays statistics such as the number of comparisons and swaps performed by each algorithm.
-
Supports pausing, resuming, and resetting the visualization.
-
Clone the repository:
git clone https://github.com/balaganesh102004/Sorting-Visualizer.git
-
Navigate to the project directory:
cd Sorting-Visualization -
Install the required dependencies:
pip install -r requirements.txt
-
Run the application:
python sorting visualizer.py
-
Choose a sorting algorithm from the available options.
-
Adjust the input size, delay, minimum and maximum values according to your preferences.
-
Click the "Start" button to begin the visualization.
-
Observe the step-by-step visualization and analyze the sorting process.
-
Use the pause, resume, and reset buttons to control the visualization.
Contributions to this project are welcome and encouraged! If you would like to contribute, please follow these steps:
- Fork the repository.
- Create a new branch for your feature or bug fix.
- Make your changes and commit them with descriptive commit messages.
- Push your changes to your fork.
- Submit a pull request, explaining the changes you made and why they should be merged.
This project is licensed under the MIT License. See the LICENSE file for more details.