GitHub - dominic-source/sorting_algorithms: This program showcases how to implement various sorting algorithms and their time complexities

To run any of these programs

Look for any c file and run this:

gcc -Wall -Wextra -Werror -pedantic -std=gnu89 nameofcfile.c -o runme

then run: ./runme

Name		Name	Last commit message	Last commit date
Latest commit History 46 Commits
.107-quick_sort_hoare.c.swp		.107-quick_sort_hoare.c.swp
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
104-O		104-O
104-heap_sort.c		104-heap_sort.c
107-O		107-O
107-main.c		107-main.c
107-quick_sort_hoare.c		107-quick_sort_hoare.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
print_array.c		print_array.c
print_list.c		print_list.c
quick		quick
sort.h		sort.h

dominic-source/sorting_algorithms