Welcome to the Sorting Algorithms Repository by spy404! This repository is dedicated to exploring and implementing various sorting algorithms in different programming languages. Whether you're a student learning about algorithmic efficiencies, a developer looking to understand different sorting techniques, or just curious about sorting algorithms, you'll find this repository useful.
In this repository, you will find implementations of several common and advanced sorting algorithms, such as:
- Bubble Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Radix Sort
- ...and more!
Each algorithm is implemented in multiple programming languages to cater to a wide audience.
Contributions to this repository are welcome! If you'd like to add a new sorting algorithm, improve existing implementations, or provide translations and documentation, please follow these steps:
- Fork the repository.
- Create a new branch for your feature (
git checkout -b feature/YourFeature
). - Commit your changes (
git commit -am 'Add some feature'
). - Push to the branch (
git push origin feature/YourFeature
). - Open a new Pull Request.
This project is licensed under the MIT License - see the LICENSE file for details.
- A big thank you to everyone who has contributed to this repository.
- Special thanks to those who have provided valuable feedback and suggestions.
Happy Sorting! ๐