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

Resources

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

Task	File
0. Bubble sort	0-bubble_sort.c_
1. Insertion sort	1-insertion_sort_list.c
2. Selection sort	2-selection_sort.c
3. Quick sort	3-quick_sort.c
4. Shell sort - Knuth Sequence	100-shell_sort.c
5. Cocktail shaker sort	101-cocktail_sort.c
6. Counting sort	102-counting_sort.c
7. Merge sort	103-merge_sort.c
8. Heap sort	104-heap_sort.c
9. Radix sort	105-radix_sort.c
10. Bitonic sort	106-bitonic_sort.c
11. Quick Sort - Hoare Partition scheme
12. Dealer

Name		Name	Last commit message	Last commit date
Latest commit History 56 Commits
.vscode		.vscode
.gitignore		.gitignore
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
100-shell_sort.c		100-shell_sort.c
101-O		101-O
101-cocktail_sort_list.c		101-cocktail_sort_list.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
bubble		bubble
cocktail		cocktail
insertion		insertion
print_array.c		print_array.c
print_list.c		print_list.c
quick		quick
select		select
shell		shell
sort.h		sort.h