Sorting Visualizer is a web application that showcases the inner workings of various sorting algorithms. It provides a visual representation of the algorithms' steps, allowing users to gain a better understanding of how each algorithm functions.
- Bubble sort
- Selection sort
- Insertion sort
- Merge sort
- Quick sort
- Heap sort
- Colored representation of each step:
- Blue: Default color
- Yellow: Elements being compared
- Red: Elements identified as incorrectly positioned
- Green: Elements in the correct position
- Controls for visualizations:
- Speed control (with 5 speed levels)
- Data size control
- Data generation (randomly generate new data)
- Time and space complexity analysis of the algorithm being visualized.
- Clone the repository:
git clone https://github.com/abhis1609/SortViz.git - Open the
index.htmlfile in your web browser. - Select an algorithm from the menu and adjust visualization settings.
- Click "Start" to begin the visualization.
Feel free to contribute to this project by adding more sorting algorithms or improving existing ones!
Click here to see a live demo of the Sorting Visualizer in action.
This project is licensed under the MIT License.