Sorting_Algorithms

A Sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements.

The comparison operator is used to decide the new order of elements in the respective data structure.

Name		Name	Last commit message	Last commit date
Latest commit History 4 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
1000-main.c		1000-main.c
1000-sort_deck.c		1000-sort_deck.c
101-O		101-O
101-cocktail_sort_list.c		101-cocktail_sort_list.c
101-main.c		101-main.c
102-O		102-O
102-counting_sort.c		102-counting_sort.c
102-main.c		102-main.c
103-O		103-O
103-main.c		103-main.c
103-merge_sort.c		103-merge_sort.c
104-O		104-O
104-heap_sort.c		104-heap_sort.c
104-main.c		104-main.c
105-main.c		105-main.c
105-radix_sort.c		105-radix_sort.c
106-O		106-O
106-bitonic_sort.c		106-bitonic_sort.c
106-main.c		106-main.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
deck.h		deck.h
print_array.c		print_array.c
print_list.c		print_list.c
sort.h		sort.h
swap.c		swap.c

Provide feedback