The Sorting Visualizer project is designed to facilitate learning and visualization of various sorting algorithms. The main objectives include observing the step-by-step execution of sorting algorithms, visualizing the swapping or divide-and-conquer steps, and gaining insights into how these algorithms work.
- Algorithm Visualization: Visual representation of sorting algorithms to observe their execution steps.
- Bar Graph Representation: The data to be sorted is represented as a bar graph for clear visualization.
- Sorting Algorithms: Implementation and visualization of five different sorting algorithms.
- Color Coding: Different colors are used to enhance visualization, providing a clear distinction during the sorting process.
The project includes the visualization of the following sorting algorithms:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
-
Select Algorithm:
- Choose the sorting algorithm from the available options.
-
Adjust Speed:
- Adjust the speed of the visualization to observe the sorting process at different rates.
-
Visualize Sorting:
- Initiate the sorting process to visualize how the algorithm performs step by step.
-
Observe Results:
- Watch as the bar graph rearranges itself, showcasing the sorting algorithm in action.
-
Clone the repository:
git clone https://github.com/your-username/sorting-visualizer.git
-
Navigate to the project directory:
cd sorting-visualizer -
Open the index.html file in a web browser:
open index.html
Contributions are welcome! If you'd like to contribute to the Sorting Visualizer project, please check our contribution guidelines.
This project is licensed under the MIT License.