/Sorting_Algorithms

This GitHub repository contains implementations of various sorting algorithms studied during the 3rd semester Data Structures and Algorithms course.

Primary LanguageC++

Sorting Algorithms Implementation 🧠💻

Welcome to the Sorting Algorithms Implementation repository! This collection features implementations of various sorting algorithms in different programming languages. Each algorithm is thoroughly explained and tested for a better understanding.

Algorithms Implemented:

  • Bubble Sort 🛁
  • Selection Sort 🎯
  • Insertion Sort 📥
  • Merge Sort 🔄
  • Quick Sort ⚡
  • Heap Sort 📚

How to Contribute:

If you're interested in contributing to this repository, please feel free to open an issue for bug reports or suggest improvements. I encourage contributions in the form of bug fixes, enhancements, and additional implementations of sorting algorithms.

Contribution Steps:

  1. Fork the Repository:

    Fork the repository to your GitHub account.

  2. Clone the Repository:

    Clone the forked repository to your local machine.

    git clone https://github.com/B3TA-BLOCKER/Sorting_Algorithms.git

  3. Create a New Branch:

    Create a new branch for your contributions.

    git checkout -b feature/new-feature

  4. Make Changes:

    Implement your changes or additions to sorting algorithms.

  5. Commit Changes:

    Commit your changes with a descriptive commit message.

    git commit -m "Add Bubble Sort implementation 🛁"

  6. Push Changes:

    Push your changes to your forked repository.

    git push origin feature/new-feature