This project is part of our CSE 221 course at Egypt University of Informatics (EUI) This repository contains implementations of various sorting algorithms in Python. These algorithms are commonly used in computer science and are essential for understanding fundamental sorting concepts.

The repository currently includes the following sorting algorithms:

• Bubble Sort
• Bucket Sort
• Comb Sort
• Heap Sort
• Insertion Sort
• Merge Sort
• Quicksort
• Selection Sort

Each algorithm is implemented in a separate Python file in this repository.

To use the sorting algorithms in your own projects, follow these steps:

1. Clone the repository to your local machine using the following command:

   git clone https://github.com/mohammed-alaa40123/sorting.git
   

2. Navigate to the cloned repository:

   cd sorting
   

3. Install the required Python packages by running:

pip install -r requirements.txt

Run the app using the following command:

streamlit run app.py

4. Call the sorting function provided by the chosen algorithm, passing the array or list that you want to sort as the input.

5. Run your Python program and observe the sorted output.

Contributions are welcome! If you would like to contribute to this repository, please follow these guidelines:

1. Fork the repository.

2. Create a new branch for your feature or bug fix:

   git checkout -b my-feature
   

3. Make your changes and commit them:

   git commit -m "Add new feature"
   

4. Push your changes to your forked repository:

   git push origin my-feature
   

5. Create a new pull request, explaining your changes and why they should be merged.

This repository is licensed under the MIT License. Feel free to use the code in this repository for educational or commercial purposes.

If you have any questions or suggestions regarding this repository, please feel free to open an issue or contact the repository owner.

Happy sorting!