Project done during ALX Software Engineering Programme at ALX. It aims to learn about Sorting algorithms, Big O, Sorting algorithms animations, stable sorting algorithm, how to evaluate the time complexity of an algorithm in C language.
- All C files are compiled using
gcc - All C files are written according to the BETTY CODING STYLE
- Tested on Ubuntu 20.04 LTS
All of the following files are programs written in C:
Function Prototypes:
| File | Prototype |
|---|---|
print_array.c |
void print_array(const int *array, size_t size) |
print_list.c |
void print_list(const listint_t *list) |
0-bubble_sort.c |
void bubble_sort(int *array, size_t size); |
1-insertion_sort_list.c |
void insertion_sort_list(listint_t **list); |
2-selection-sort.c |
void selection_sort(int *array, size_t size); |
3-quick_sort.c |
void quick_sort(int *array, size_t size); |
100-shell_sort.c |
void shell_sort(int *array, size_t size); |
101-cocktail_sort_list.c |
void cocktail_sort_list(listint_t **list); |
102-counting_sort.c |
void counting_sort(int *array, size_t size); |
103-merge_sort.c |
void merge_sort(int *array, size_t size); |
104-heap_sort.c |
void heap_sort(int *array, size_t size); |
105-radix_sort.c |
void radix_sort(int *array, size_t size); |
106-bitonic_sort.c |
void bitonic_sort(int *array, size_t size); |
107-quick_sort_hoare.c |
void quick_sort_hoare(int *array, size_t size); |
1000-deck_node.c |
void sort_deck(deck_node_t **deck); |