SortingAlgos🚀

✨ A repository to store all kinds of Sorting Algorithms ✨

📖 About The Project :

This repository is a comprehensive collection of various sorting algorithms used in Data Structures and Algorithms (DSA). It serves as a valuable resource for students, educators, and anyone looking to understand and implement these algorithms.

📚 Algorithms Included:

• 🧊 Bubble Sort
• 🎯 Selection Sort
• ➡️ Insertion Sort
• ⚡ Quick Sort
• 🔄 Merge Sort
• 🏗️ Heap Sort
• 🔢 Radix Sort
• 🧮 Counting Sort
• 🐚 Shell Sort

(Note: Don't forget to update this list as you add more algorithms)

💻 Usage :

Each algorithm is implemented in its own separate file. To use any of these algorithms, simply import the corresponding file into your project. All codes are written in C++

🤝 Contributing :

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.

• If you have suggestions for adding or removing projects, feel free to open an issue to discuss it, or directly create a pull request after you edit the README.md file with necessary changes.
• Please make sure you check your spelling and grammar.
• Create individual PR for each suggestion.

📜 Creating A Pull Request :

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/NewFeature)
3. Commit your Changes (git commit -m 'Add some NewFeature')
4. Push to the Branch (git push origin feature/NewFeature)
5. Open a Pull Request

👨🏻‍💻 Authors :

• Rohan Mitra - Computer Science Student - Github