MergeSort.java

packageSorting.MergeSort;

publicclassMergeSort {

publicvoidmerge(int[] A, intleft, intmiddle, intright){
int[] leftTempArray = newint[middle - left + 2];
int[] rightTempArray = newint[right - middle + 1];
for (inti = 0; i <= middle - left; i++) {
leftTempArray[i] = A[left + i];
 }
for (inti = 0; i < right - middle; i++) {
rightTempArray[i] = A[middle + 1 + i];
 }
leftTempArray[middle - left + 1] = Integer.MAX_VALUE;
rightTempArray[right - middle] = Integer.MAX_VALUE;
inti = 0, j = 0;
for (intk = left; k <= right; k++) {
if (leftTempArray[i] < rightTempArray[j]) {
A[k] = leftTempArray[i];
i++;
 } else {
A[k] = rightTempArray[j];
j++;
 }
 }
 }

publicvoidmergeSort(int[] Array, intleft, intright){
if (right > left) {
intm = (left + right) / 2;
mergeSort(Array, left, m);
mergeSort(Array, m + 1, right);
merge(Array, left, m, right);
 }
 }

publicstaticvoidprintArray(int []array) {
for (inti = 0; i < array.length; i++) {
System.out.print(array[i]+" ");
 }
 }


}