Question

Implement a parallelized Merge Sort algorithm to sort a given set of elements and determine the time required to sort the clements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator in python​

Answer 1

Answer:

hahahahahahhahaahhahahahahahahhahahaha