This is a sorting visualizer web application built with HTML, CSS, and JavaScript. It allows users to visualize various sorting algorithms in action.
- Visualize popular sorting algorithms:
- Bubble Sort
- Merge Sort
- Heap Sort
- Insertion Sort
- Quick Sort
- Adjustable speed control to control the visualization speed.
- Dynamic array size adjustment.
-
Clone the repository:
git clone https://github.com/MuhammadAliashraf/Sorting-visualizer.git
-
Open the
index.html
file in your web browser.
- Click on the "Randomize Array" button to generate a new random array.
- Select a sorting algorithm from the dropdown menu.
- Click on the "Sort" button to visualize the selected sorting algorithm in action.
- Use the speed control slider to adjust the visualization speed.
- Use the array size slider to adjust the size of the array.
- Bubble Sort
- Merge Sort
- Heap Sort
- Insertion Sort
- Quick Sort
Contributions are welcome! If you'd like to contribute to this project, please follow these steps:
- Fork the repository.
- Create a new branch (
git checkout -b feature/your-feature-name
). - Make your changes.
- Commit your changes (
git commit -am 'Add some feature'
). - Push to the branch (
git push origin feature/your-feature-name
). - Create a new Pull Request.
This project is licensed under the ISC License