0x1A. C - Sorting algorithms & Big O

0. Bubble sort

Write a function that sorts an array of integers in ascending order using the Bubble sort algorithm
Write in the file 0-O, the big O notations of the time complexity of the Bubble sort algorithm, with 1 notation per line

Write a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm
Write in the file 1-O, the big O notations of the time complexity of the Insertion sort algorithm, with 1 notation per line

Write a function that sorts an array of integers in ascending order using the Selection sort algorithm
Write in the file 2-O, the big O notations of the time complexity of the Selection sort algorithm, with 1 notation per line

Write a function that sorts an array of integers in ascending order using the Quick sort algorithm
Write in the file 3-O, the big O notations of the time complexity of the Quick sort algorithm, with 1 notation per line

AUTHOR: BRENT JANSKI, JACK TRAN

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
0-O		0-O
0-bubble_sort.c		0-bubble_sort.c
0-main.c		0-main.c
1-O		1-O
1-insertion_sort_list.c		1-insertion_sort_list.c
1-main.c		1-main.c
100-shell_sort.c		100-shell_sort.c
101-O		101-O
101-cocktail_sort_list.c		101-cocktail_sort_list.c
102-O		102-O
102-counting_sort.c		102-counting_sort.c
103-O		103-O
103-merge_sort.c		103-merge_sort.c
104-O		104-O
104-heap_sort.c		104-heap_sort.c
2-O		2-O
2-main.c		2-main.c
2-selection_sort.c		2-selection_sort.c
3-O		3-O
3-main.c		3-main.c
3-quick_sort.c		3-quick_sort.c
README.md		README.md
bubble		bubble
insertion		insertion
print_array.c		print_array.c
print_list.c		print_list.c
quick		quick
select		select
sort.h		sort.h