Problem Statement

Given an array of size $\text{'}n\text{'},$ sort the array in ascending order using Merge Sort algorithm and find out the median value. The median is the value that is present in the middle of a sorted array containing odd number of values. If the sorted array contains even number of values, median is the average of middle two values.

Implement the functionalities based on the description given below.

Method Description

mergeSort$($int$[]$ elements, int size$)$

Sort the array using the merge sort algorithm

merge$($int$[]$ elements, int$[]$ left, int$[]$ right, int leftMerge, int rightMerge$)$

Merge the left array and right array to produce new sorted arrays

findMedian$($int elements$[])$

Find out and return the median value

Test the functionalities using the main$()$ method of the Tester class.

Sample Input and Output

$\backslash$table$[[$Sample Input,Expected Output$],[$arr $=[64,34,25,12,22,11,90],12\mathrm{.}0],[$art $=[10,20,30,40],25\mathrm{.}0]]$

Download the Java project from here to solve this exereise in Eclipse