Sorting Algorithms

Project completed during Fullstack Software Engineering program at ALX. It aims to showcase sorting algorithms (bubble sort, insertion sort, selection sort, quick sort and so on) and Big O Notation in C language.

Technologies

• Scripts written in Bash
• C files are compiled using GCC
• Tested on Ubuntu and Windows 11

Files

All the following programs were written in C:

Filename	Description
0-bubble_sort.c	sort an array of integers in ascending order using the Bubble sort algorithm
0-O	save the best, average and worst case of the time complexity of the Bubble sort algorithm
1-insertion_sort_list.c	sort an array of integers in ascending order using the Insertion sort algorithm
1-O	save the best, average and worst case of the time complexity of the Insertion sort algorithm
2-selection_sort.c	sort an array of integers in ascending order using the Selection sort algorithm
2-O	save the best, average and worst case of the time complexity of the Selection sort algorithm
3-quick_sort.c	sort an array of integers in ascending order using the Quick sort algorithm
3-O	save the best, average and worst case of the time complexity of the Quick sort algorithm
100-shell_sort.c	sort an array of integers in ascending order using the Shell sort algorithm
100-O	save the best, average and worst case of the time complexity of the Shell sort algorithm
101-cocktail_sort_list.c	sort an array of integers in ascending order using the Cocktail shaker sort algorithm
101-O	save the best, average and worst case of the time complexity of the Cocktail shaker sort algorithm
102-counting_sort.c	sort an array of integers in ascending order using the Counting sort algorithm
102-O	save the best, average and worst case of the time complexity of the Counting sort algorithm
103-merge_sort.c	sort an array of integers in ascending order using the Merge sort algorithm
103-O	save the best, average and worst case of the time complexity of the Merge sort algorithm
104-heap_sort.c	sort an array of integers in ascending order using the Heap sort algorithm
104-O	save the best, average and worst case of the time complexity of the Heap sort algorithm
105-radix_sort.c	sort an array of integers in ascending order using the Radix sort algorithm
105-O	save the best, average and worst case of the time complexity of the Radix sort algorithm
106-bitonic_sort.c	sort an array of integers in ascending order using the Bitonic sort algorithm
106-O	save the best, average and worst case of the time complexity of the Bitonic sort algorithm
107-quick_sort_hoare.c	sort an array of integers in ascending order using the Quick sort algorithm
107-O	save the best, average and worst case of the time complexity of the Quick sort algorithm
1000-sort_deck.c	sort a deck of cards

Authors

• Kay Cee - sekaycee
• Donald Ajaps - adobki