- 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.
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); |
Have happy coding ๏ฟฝ
Alban ๐ฑโ๐ค