The Sorting Visualizer is a web-based application that allows users to visualize various sorting algorithms in action. This project is designed to help users better understand how different sorting algorithms work and how they perform under various scenarios.
- Visualization of popular sorting algorithms, including:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Adjustable array size for testing different input data sizes.
- Speed control to slow down or speed up the visualization.
- Real-time visualization of the sorting process.
- Detailed algorithm descriptions and complexity analysis.
Clone this repository to your local machine:
git clone https://github.com/your-username/sorting-visualizer.gitNavigate to the project directory:
cd sorting-visualizerCompile the source code
gcc -o main main.c -I./sort_lib -L./sort_lib -lSDL2 -lSDL2main -lsortingExecute the main file
./mainIf you'd like to contribute to this project, please follow these steps:
-
Fork the repository.
-
Create a new branch for your feature or bug fix:
git checkout -b feature/new-featureor
git checkout -b bugfix/issue-fix- Make your changes and commit them:
git commit -m "Add new feature" # Use a descriptive commit message- Push your changes to your fork:
git push origin feature/new-feature-
Create a pull request from your fork to the original repository.
-
Your pull request will be reviewed, and once approved, it will be merged into the main branch.
This project is licensed under the MIT License. See the LICENSE file for details.
Special thanks to Algorithm Visualizer for inspiration and guidance. Thanks to the open-source community for providing valuable resources and libraries.
If you have any questions or suggestions, feel free to contact us at 21889udbhav@gmail.com.
Disclaimer: This project is for educational purposes and is not intended for production use. It is meant to help individuals learn and understand sorting algorithms.