Please use format attached to question and write in pythonMod $7$ Lab: Which sorting algorithm is which?

Differentiate $5$ sorting algorithms $($bubble$,$ selection, insertion, merge, and quick$)$ based on how long

they take to sort certain lists.

When you submit a file called numbers.txt to Gradescope, it will sort the numbers inside with these $5$

algorithms, aliased as alg$\_$a$,$ alg$\_$b$,$ alg$\_$c$,$ alg$\_$d$,$ and alg$\_$e:

$n=1000$

alg $t($ms$)$

alg$\_$a $24\mathrm{.}6$

alg$\_$b $1\mathrm{.}35$

alg$\_$c $57$

alg$\_$d $2\mathrm{.}12$

alg$\_$e $40\mathrm{.}1$

You need to

Create lists of different lengths and patterns

Determine which alias corresponds to which sorting algorithm

Answers

Write your answers in answers. py$.$ It contains a dictionary where the keys are the aliased algorithms; you

just need to enter the correct values $(\text{'}$bubble$\text{'},$ 'selection', 'insertion', 'merge', or 'quick'$)$:

answers $=\{\text{'}$alg$\_$a$\text{'}$: $\text{'}\text{'},$ 'alg$\_$b$\text{'}$: $\text{'}\text{'},$ 'alg$\_$c$\text{'}$: $\text{'}\text{'},$ 'alg$\_$d$\text{'}$: $\text{'}\text{'},$ 'alg$\_$e$\text{'}$: $\text{'}\text{'}$

Mod $7$ Lab: Which sorting algorithm is which?

Differentiate $5$ sorting algorithms $($bubble$,$ selection, insertion, merge, and quick$)$ based on how long

they take to sort certain lists.

When you submit a file called numbers.txt to Gradescope, it will sort the numbers inside with these $5$

algorithms, aliased as alg$\_$a$,$ alg$\_$b$,$ alg$\_$c$,$ alg$\_$d$,$ and alg$\_$e:

$================$

n $=1000$

$----------------$

alg t $($ms$)$

$----------------$

alg$\_$a $24\mathrm{.}6$

alg$\_$b $1\mathrm{.}35$

alg$\_$c $57$

alg$\_$d $2\mathrm{.}12$

alg$\_$e $40\mathrm{.}1$

$----------------$

You need to

$1)$ Create lists of different lengths and patterns

$2)$ Determine which alias corresponds to which sorting algorithm

Answers

Write your answers in answers.py$.$ It contains a dictionary where the keys are the aliased algorithms; you

just need to enter the correct values $($bubble$,$selection$,$insertion$,$merge$,$ or $$quick$)$:

answers $=\{\text{'}$alg$\_$a$\text{'}$: $\text{'}\text{'},$ 'alg$\_$b$\text{'}$: $\text{'}\text{'},$ 'alg$\_$c$\text{'}$: $\text{'}\text{'},$ 'alg$\_$d$\text{'}$: $\text{'}\text{'},$ 'alg$\_$e$\text{'}$: $\text{'}\text{'}\}$

Lab Notes

$$ generate$\_$numbers.py contains code to automate the generation of numbers.txt$.$

$$ Each algorithm is used exactly once.

$$ The bubble and insertion sorts are adaptive $-$ they can sort in O$($n$)$ in the best case.

$$ The quicksort algorithm always uses the last element in a sublist as the pivot.

$$ The largest list you can create is $2000$ items due to resource constraints on Gradescope.

Submitting

Students must submit individually by the due date $($typically$,$ Sunday at $11$:$59$ pm EST$)$ to receive credit.

Grading

This assignment is entirely auto$-$graded: $20$ points per correct algorith