CODING GUIDES(C++):

1. Use of proper variable declaration/initialization according to the naming conventions (camelCase, snake_case, PascalCase )

2. Use of proper function for each module.

You have learned merge sort in data structures which sorts an array in nlogn time, it is a divide and conquer technique. We can enhance the performance of merge sort using the multithreading. First of all, you have to check the processor cores of your system, lets suppose your system processor has 4 cores. Now you have to create 4 threads and divide the array among these threads and sort them using merge sort. You have to take size of array and array elements from user.

For this question you have to submit three things multithreaded merge sort C++ CODE, screenshot of available cores in your system and also the mac address screenshot of your system. No need to implement merge sort from scratch you can use merge sort code from internet but provide the link of source in the code.

NOTE:

TAKE 4 CORES. NO PLAGIARISM