In Program $1,$ each student will select three $(3)$ sorting algorithms to analyze and implement. There will

be static analysis of the algorithms $-$ based on the written pseudo$-$code $-$ as well as analysis of the

performance of the algorithms $-$ based on the execution of the code.

I will give you several input files that will allow us to analyze various aspects of the code. All the data are

integers between $1$ and $100$ inclusive and you will be given the following data sets:

shuffled.txt $-$ the integers $1-100$ in random order $-$ i$.$e$.,$ shuffled

sorted. txt $-$ the integers $1-100$ in sorted order $($ascending order$)$

nearly$\_$sorted.txt $-$ the integers $1-100$ in nearly sorted order

unsorted. txt $-$ the integers $1-100$ in unsorted order $($descending order$)$

nearly$\_$unsorted. txt $-$ the integers $1-100$ in nearly unsorted order

duplicate $.$ txt $-100$ integers $10,20,$dots,$100-$ i$.$e$.,$ many duplicates $-$ in random order

one$\_$million$\_$randoms $.$ txt $-1,000,000$ integers $1-100$ in random order

All the files have the following format with one entry per line:

Description of the data set

$A[1]A[2]A[n]O(n^2)O(nlgn)O(n)$