README.md

0X1B. C-Sorting algorithms & Big O

---

Objectives met:

• Learnt and implemented at least 4 different sorting algorithms in C.
• Learnt how to evaluate the time complexity of an algorithm.
• Learnt what the Big O notation is and it's uses.
• Learnt how to select the best sorting algorithm for a given input.
• Learnt what is a stable sorting algorithm.

About the code:

---

* This code was compiled using: ```bash gcc -Wall -Wextra -Werror -pedantic -std=gnu89 .c ```

Implemented algorithms:

• Array based:

---

• Bubble sort
• Selection sort
• Quick sort (Lomuto partition scheme)
• Shell sort (Knuth sequence)
• Counting sort
• Merge sort
• Heap sort
• Radix sort
• Bitonic sort
• Quick sort (Hoare partition scheme)

---

• Doubly linked list based:

---

• Insertion sort
• Cocktail shaker sort

Card sorting project.

---

Used the qsort library function to sort cards via decks and in sequence.
Card sorting

---

---

Made with love by: Francis Nderitu @Gus-Victrix