This project is about sorting algorithms and Big O notations.
-
Bubble sort: The simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
-
Insertion sort: Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.
-
Selection sort: The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.
-
sort.h - Header file with prototypes and structures.
-
print_array.c - Function that prints an array of integers.
-
print_list.c - Function that prints a list of integers.
-
0-bubble_sort.c - Bubble sort algorithm.
- 0-O - Time complexity of bubble sort algorithm.
-
1-insertion_sort_list.c - Insertion sort algorithm.
- 1-O - Time complexity of insertion sort algorithm.
-
2-selection_sort.c - Selection sort algorithm.
- 2-O - Time complexity of selection sort algorithm.
-
3-quick_sort.c - Quick sort algorithm.
- 3-O - Time complexity of quick sort algorithm.