GitHub repository: BoodaZ/MPIMergeSortArray
Created: 2016-05-25T01:17:10Z
Description: Sorting algorithm.  a. Process (0) will initialize an array of 1000 integers with any numbers. b. Process (0) will send N partitions of the array to N processes, each partition of size = (N\ Process count). c. Each Other Process will receive the array part. d. Each Other Process will sort the received array part. e. Each Other Process will send the sorted array back to process (0). f. Process (0) will receive the sorted array parts. g. Process (0) will merge each received part to the final sorted array. i. Merging array parts can be used using a merge function that merges two sorted arrays, the merge function is in the same folder with this document “MergeSortedArrays” and how to be used.