Description $($Analysis of Sorting Algorithms$)$:

$$ Objective:

o To compare the performance of a simple sorting algorithm and a sophisticated sorting

algorithm by implementing both in C and analyzing their runtimes on different

datasets.

$$ Instructions:

o Implement the sorting algorithms using C

o Provide a summary of how they work

$$ Generate Test Data:

o Write a function to generate three types of integer arrays of different sizes $($e$.$g$.100,$

$1000$ and $10,000)$ :

$$ Random Order

$$ Sorted in Ascending Order

$$ Sorted in Descending Order

$$ Measure Runtime:

o Measure the runtime of each sorting algorithm on the three types of datasets using the

clock$()$ function from time.h$.$

o Run each test multiple times $($e$.$g$.,3$ times$)$ and take the average runtime to ensure

accuracy.

$$ Analyze and Compare:

o Compare the runtimes of the algorithms

o Use suitable visualizations appropriately

o Note any observable differences in performance on the different types of datasets.