Divide$-$and$-$Conquer Sorting

Tasks:

$1.$ Implement and sort the array $[38,27,43,3,9,82,10]$ using the

following algorithms:

i$.$ Merge Sort

ii$.$ Quick Sort

$2.$ Show intermediate steps of sorting for each algorithm. $3.$ Test all implemented sorting algorithms $($Insertion$,$ Bubble, Selection, Merge, Quick Sort$)$ on an array of $1000$ randomly generated integers. $4.$ Measure and record the time taken for each algorithm to sort the array. Deliverables:

$1.$ Python files $($divide$\_$conquer$\_$sorting.py and sorting$\_1000.$py$)$

with implementations for tasks $1$ and $3.2.$ Report showing the array at each significant step of sorting. $3.$ Report comparing the performance of each sorting algorithm, including

recorded times and observations.