0x1B. C - Sorting algorithms & Big O

Description

• The project was compiled using "gcc -Wall -pedantic -Werror -Wextra -std=gnu89"
• The project was tested on ubuntu 20.04.

Files

All Tasks were written in C language.

Task	Description
Task:0	Write a function that sorts an array of integers in ascending order using the Bubble sort algorithm.
Task:1	Write a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm.
Task:2	Write a function that sorts an array of integers in ascending order using the Selection sort algorithm.
Task:3	Write a function that sorts an array of integers in ascending order using the Quick sort algorithm.
Task:4	Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence.
Task:5	Write a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm.
Task:6	Write a function that sorts an array of integers in ascending order using the Counting sort algorithm.
Task:7	Write a function that sorts an array of integers in ascending order using the Merge sort algorithm.
Task:8	Write a function that sorts an array of integers in ascending order using the Heap sort algorithm.
Task:9	Write a function that sorts an array of integers in ascending order using the Radix sort algorithm.
Task:10	Write a function that sorts an array of integers in ascending order using the Bitonic sort algorithm.
Task:11	Write a function that sorts an array of integers in ascending order using the Quick sort algorithm.
Task:12	Write a function that sorts a deck of cards.