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

📘Authors: Ntuthuko Zimu & Tshupane Morake

TASKS:

0. Bubble sort - 0-bubble_sort.c, 0-O

Function that sorts an array of integers in ascending order using the Bubble sort algorithm.
The file 0-O contains the big O notations of the time complexity of the Bubble sort algorithm.

1. Insertion sort - 1-insertion_sort_list.c, 1-O

Function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm.
The file 1-O contains the big O notations of the time complexity of the Insertion sort algorithm.

2. Selection sort - 2-selection_sort, 2-O

Function that sorts an array of integers in ascending order using the Selection sort algorithm.
The file 2-O contains the big O notations of the time complexity of the Selection sort algorithm.

3. Quick sort - 3-quick_sort.c, 3-O

Function that sorts an array of integers in ascending order using the Quick sort algorithm.
The file 3-O contains the big O notations of the time complexity of the Quick sort algorithm

🐚 Advance tasks!! 🐚

103. Merge sort - 103-merge_sort.c, 103-O

Function that sorts an array of integers in ascending order using the top-down Merge sort algorithm.
The file 103-O contains the big O notations of the time complexity of the Merge sort algorithm.

104. Heap sort - 104-heap_sort.c, 104-O

Function that sorts an array of integers in ascending order using the sift-down Heap sort algorithm.
The file 104-O contains the big O notations of the time complexity of the Heap sort algorithm.

105. Radix sort - 105-radix_sort.c

Function that sorts an array of integers in ascending order using the Radix sort algorithm