0x1B. C - Sorting algorithms & Big O

Description

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

• Write a function that sorts an array of integers in ascending order using the Bubble sort algorithm

1. Insertion sort

• Write a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm

2. Selection sort

• Write a function that sorts an array of integers in ascending order using the Selection sort algorithm

3. Quick sort

• Write a function that sorts an array of integers in ascending order using the Quick sort algorithm

4. Shell sort - Knuth Sequence

• Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence

5. Cocktail shaker sort

• Write a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm

6. Counting sort

• Write a function that sorts an array of integers in ascending order using the Counting sort algorithm

7. Merge sort

• Write a function that sorts an array of integers in ascending order using the Merge sort algorithm

8. Heap sort

• Write a function that sorts an array of integers in ascending order using the Heap sort algorithm

9. Radix sort

• Write a function that sorts an array of integers in ascending order using the Radix sort algorithm

10. Bitonic sort

• Write a function that sorts an array of integers in ascending order using the Bitonic sort algorithm

11. Quick Sort - Hoare Partition scheme

• Write a function that sorts an array of integers in ascending order using the Quick sort algorithm

12. Dealer

• Write a function that sorts a deck of cards.

---

Author

• Jhoan Stiven Zamora Caicedo - jzamora5
• Angel Omar Pedroza Cardenas - AngelPedroza