The sorting algorithms included in this question are given in the below.

Hybrid sorted

You will sort integer lists of size $[2**$x for x in range$(6,17,2)].$Before the sorting occurs, the integer lists will be initialized as follows:

$$Completely random list,

$$Partially sorted list, i$.$e$.90\%$sorted$,10\%$randomly placed,

$$Fully sorted list,

$$Reverse sorted list.

You will be running assigned algorithms for each list sizes and for each data configurations. You will measure execution time of the algorithms, and number of swap operations for each case. You may use any of timeit.timeit$()$or time.perf$\_$counter$()$commands in Jupyter Notebook.

For this assignment you will deliver the following:

$1.$Your report that includes

a$.$Problem $($sorting$)$definition$,$

b$.$Your approach$($es$)$to the problem,

c$.$Pseudocode of the algorithm$($s$),$

d$.$Results table $($one for each assigned algorithm$),$and discussions.