In the merge sort algorithm, what does the conquer step do in the divide-and-conquer technique?

show example on implementing Merge sort and Quick sort

Dr. Sponge thinks it's too hard to implement Merge. So, he wants to replace Merge with Insertion Sort (yes, the insertion sort you learned in class). The following is the pseudo-code of the new Merge-Sort, Merge-Sort(p, r) 1. if p == r return 2. q = floor of (p+ r) / 2 3. Merge-Sort(p, q) 4. Merge-Sort(q+1, r) 5. Insertion-Sort(p, r) Give the recurrence for the running time of this new Merge-Sort and solve it. We let T(n) denote the running time when input array has n elements. By solving the recurrence (no need to show how you solved it), we obtain T(n) =

Write a merge Merge Sort Implementation in Go.

Follow these steps every time it has to identify two arrays to merge in order to develop a bottom-up mergesort that takes use of the order of the arrays: To make a sorted subarray, locate the first item of an array that is smaller than its predecessor, then the second, and so on. Consider the array size and the number of maximal ascending sequences in the array when calculating the execution time of this method.

4- Sort the list A[]={ 20, 13,4, 34, 5, 15, 90, 100, 75, 102, 112, 1} a) Using Merge Sort and show the order that the Merge procedure is performed. b) Explain the average case of Merge Sort. Give a detail explanation of how we can estimate the mean in relationship with the worst and best-case scenarios (hint: use the answer for question 3 as a lower-bound for the average).

Trace the execution of Bubble-sort on the list: 30, 7, 21, 42, 57, 90, 3, 11

Note that this is also a Data Structure question.