Project

In this Project, you will use sorting algorithms to sort $3$ different sets of generated input data, namely:

$1-$ Random data

$2-$ Sorted data

$3-$ Sorted data in reverse order

This work took theoretical and empirical studies that have been done over the past weeks on sorting algorithms and corresponding variants. The study includes a comparative study of sorting algorithms $($Insertion sort, Merge sort, and Quick sort$)$ as given in class.

Input: $6$ large sets of input integers. Leave the size of the set to be determined by the user. i$.$e$.$

Enter the size of set # $1$:

Enter the size of set # $2$: $...$

then select one of the $3$ cases listed above.

Procedure: Find the running time of each algorithm on all input sets $(3$ cases listed above$)$

Output: Record your output in an excel sheet $($one table$)$

Visualization: Plot the recorded times for all algorithms with the corresponding sizes on the same graph $(3$ graphs for the $3$ cases listed above$).$ You may use excel tools to plot your graphs