Sorting Algorithms Analysis

On this coding excersice you will be analyzing 8 common sorting algorithms. Make sure that you document you conclusions in the Conclusions section.

Follow instructions for implementation and conclusions from the Let's code section at: https://talks.obedmr.com/content/data-structures/sorting/sorting.html

Include your profile code that you implemented at ds-profiler.

Here the list of sorting algorithms that must be implemented in the sorting.cpp file. Don't modify the functions definition.

• Bubble Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Shell Sort
• Heap Sort
• Bucket Sort

How your program will be tested

Manual Testing (please follow the given output format)

Below some examples of executions:

./main --algorithm bubble-sort
./main --algorithm bubble-sort 
./main --algorithm selection-sort 
./main --algorithm merge-sort 
./main --algorithm quick-sort 
./main --algorithm shell-sort 
./main --algorithm heap-sort 
./main --algorithm bucket-sort 

With Automation (this is how the professor will test)

make test

Expected Output (of the profiler)

Alongside the profiler output, the sorting algorithm should be displayed. Below an example.

========================================
| My Profiler       |  program_name    |
|-------------------|------------------|
| Sorting Algorithm | <algorithm_name> |
| Execution Time    | 125 nanoseconds  |
| Memory Usage      | 1 MB             |
========================================

Conclusions

YOUR CONCLUSIONS MUST BE HERE

Feel free to type as much as possible, add diagrams, graphs, code snippets and what ever makes your conclusions more clear

Grading Policy

Rubric	Points
Sorting Algorithms (8)	50
Conclusions	50
Total	100