Assume that you have Y cores on a multi-core processor to run MergeSort. Assuming that Y is

Question:

Assume that you have Y cores on a multi-core processor to run MergeSort. Assuming that Y is much smaller than length(m), express the speedup factor you might expect to obtain for values of Y and length(m). Plot these on a graph.

Consider the following recursive mergesort algorithm (another classic divide and conquer algorithm). Mergesort was first described by John Von Neumann in 1945. The basic idea is to divide an unsorted list x of m elements into two sublists of about half the size of the original list. Repeat this operation on each sublist, and continue until we have lists of size 1 in length. Then starting with sublists of length 1, "merge" the two sublists into a single sorted list. Mergesort (m) var list left, right, result if length (m) 1 return m else var middle = length (m) / 2 for each xin m up to middle add x to left for each x in m after middle add x The merge step is carried out by the following code: Merge(left, right) var list result. while length (left)