** Task 0. Bubble sort Write a function that sorts an array of integers in ascending order using the Bubble sort algorithm
** Task 1. Insertion sort Write a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm
** Task 2. Selection sort Write a function that sorts an array of integers in ascending order using the Selection sort algorithm
** Task 3. Quick sort Write a function that sorts an array of integers in ascending order using the Quick sort algorithm
** Task 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
** Task 5. Cocktail shaker sort Write a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm
** Task 6. Counting sort Write a function that sorts an array of integers in ascending order using the Counting sort algorithm
** Task 7. Merge sort Write a function that sorts an array of integers in ascending order using the Merge sort algorithm
** Task 8. Heap sort Write a function that sorts an array of integers in ascending order using the Heap sort algorithm
** Task 9. Radix sort Write a function that sorts an array of integers in ascending order using the Radix sort algorithm
**Task 10. Bitonic sort Write a function that sorts an array of integers in ascending order using the Bitonic sort algorithm
** Task 11. Quick Sort - Hoare Partition scheme Write a function that sorts an array of integers in ascending order using the Quick sort algorithm
**Task 12: Dealer; Write a function that sorts a deck of cards.
** Author: Amarachi Omereife