Question: PLEASE READ IT FULLY AND USE MULTITHREAD AND DONT USE LIBRARY JAVA LANGUAGE Write a multi-threaded implementation of the merge sort algorithm. The merge sort
PLEASE READ IT FULLY AND USE MULTITHREAD
AND DONT USE LIBRARY
JAVA LANGUAGE
Write a multi-threaded implementation of the merge sort algorithm. The merge sort algorithm in the single-threaded version is as follows:
MERGE-SORT (T, p, r):
IF p
q (p + r) / 2
MERGE-SORT (T, p, q)
MERGE-SORT (T, q + 1, r)
MERGE (T, p, q, r)
For simplicity, the multithreaded version of MERGE-SORT-MULTI should split the arrays / list of numbers / objects to be sorted between a certain number of threads (for example as many as there are processor threads available, in Java this can be checked with the method:
Runtime.getRuntime().availableProcessors()
). After thread sorting is complete, you merge the sorted arrays / lists into one.
Of course, we don't use any libraries for sorting arrays, lists, just like combining two lists / arrays into one sorted!
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
Study Help