By Farah Mccurdy and Matthew Brinkmann
This is a project about understanding different sorting algorithms and how they can be explained with big 'O' notation.
General
📄 The header file for the project is sort.h wil be required to compile locally
Each task contains the following
📄 The C code containing the algorithm, the naming is (task number)-[Algorithm Name].c
📄 Thebig O notation for the time complexity for that algorithm, the naming is (task number)-O
-
[Ubuntu 20.04 LTS] - operating system
-
[GCC 9.4.0] - compiled
-
task 0
- Algorithm: Bubble sort
-
task 1
- Algorithm: Insertion sort
-
task 2
- Algorithm: Selection sort
-
task 3
- Algorithm: Quick sort