Project: 0x1B. C - Sorting algorithms & Big O

Learning Objectives

At the end of this project, you are expected to be able to explain to anyone, without the help of Google:

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

Name		Name	Last commit message	Last commit date
Latest commit History 44 Commits
0-O		0-O
0-bubble_sort.c		0-bubble_sort.c
1-O		1-O
1-insertion_sort_list.c		1-insertion_sort_list.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
2-O		2-O
2-selection_sort.c		2-selection_sort.c
3-O		3-O
3-quick_sort.c		3-quick_sort.c
README.md		README.md
_swap_int.c		_swap_int.c
_swap_node.c		_swap_node.c
print_array.c		print_array.c
print_list.c		print_list.c
sort.h		sort.h