Sorting Visualizer is a Python project built with pygame that provides a visual representation of various sorting algorithms, including Quick Sort, Merge Sort, Bubble Sort, Heap Sort, Selection Sort, and Insertion Sort. This README aims to guide you through the project's features and how to run it on your own machine.
The project offers an interactive interface that allows you to visualize different sorting algorithms in action. It's a great tool for understanding how these algorithms work and how they compare in terms of efficiency.
You can change the size of the array being sorted using the following buttons:
: Click this button to reduce the array size.
: Click this button to increase the array size.
The default size is set at the beginning of this README file.
Choose from a variety of sorting algorithms to visualize. The available options are displayed as buttons:
Once you've selected an algorithm, click the respective button to start the visualization. You will witness the algorithm in action:
At any point during the visualization, you can stop the algorithm or reshuffle the array by clicking the following buttons:
: Use this button to halt the algorithm.- : Click this button to shuffle the array randomly.
To run this project on your PC, ensure you have Python 3.7.0 or a later version installed. Then follow these steps:
-
Install pygame using pip:
pip install pygame -
Clone this repository using the following command:
git clone https://github.com/sahil1699/Sorting-Visualizer.git -
Open your terminal, navigate to the directory where you've cloned the project, and execute the following command to start the visualizer:
python SortingVisulizer.py
Explore the world of sorting algorithms through visualization with Sorting Visualizer!