A web-based sorting visualizer that allows users to input an array of numbers and visualize the sorting process using various algorithms. This project aims to help users understand how different sorting algorithms work through interactive visualizations.
- Visualize multiple sorting algorithms:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Shell Sort
- Counting Sort
- Radix Sort
- Bucket Sort
- Comb Sort
- User-friendly interface with input validation.
- Real-time visualization of sorting processes.
- Explanations of each sorting algorithm.
- Adjustable animation speed for better understanding.
- HTML
- CSS
- JavaScript
- Google Fonts for typography
- Clone the repository to your local machine:
git clone https://github.com/TONYSTARKOP/sorting-visualizer.git
- Navigate to the project directory:
cd sorting-visualizer - Open
index.htmlin your web browser to view the application.
- Enter an array of numbers in the input field, separated by commas (e.g.,
34, 7, 23, 32, 5, 62). - Select the sorting algorithm you want to visualize from the dropdown menu.
- Adjust the animation speed using the provided input field.
- Click the "Start Sorting" button to begin the visualization.
- Observe the sorting process in real-time, with highlighted elements and explanations displayed.
Contributions are welcome! If you have suggestions for improvements or new features, feel free to open an issue or submit a pull request.
- Inspired by various educational resources on sorting algorithms.
- Special thanks to the open-source community for their contributions and support.
For any inquiries or feedback, please reach out to Anubhav Mishra.