package Sorting;
import Util.Swap;
public class MergeSort {
public static int [] mergeSort(int [] nums){
if (nums.length == 1){
return nums;
}
if(nums.length == 2){
if(nums[1] < nums[0]){
Swap.swap(nums,0,1);
}
return nums;
}
int mid = nums.length / 2;
int [] left = new int [mid];
int [] right = new int [nums.length - mid];
for(int i =0; i