fati-zid / sorting_algorithms Goto Github PK

Learning Objectives💡 What you should learn from this project:

At least four different sorting algorithms What is the Big O notation, and how to evaluate the time complexity of an algorithm How to select the best sorting algorithm for a given input What is a stable sorting algorithm

0. Bubble sort
1. Insertion sort
2. Selection sort
3. Quick sort
4. Shell sort - Knuth Sequence
5. Cocktail shaker sort
6. Counting sort
7. Merge sort
8. Heap sort
9. Radix sort
10. Bitonic sort
11. Quick Sort - Hoare Partition scheme
12. Dealer

Author:

1. Name: Fatima Zohra EZZAIDANI
2. Email: [email protected]
3. LinkedIn: https://www.linkedin.com/in/fatima-zohra-ezzaidani-436109214/ License: This project is licensed under the MIT License - see the LICENSE.md file for details. Acknowledgments:
4. My ALX teachers for their guidance and support.
5. My classmates for their help and advice.