package mergesort;
import java.util.Arrays;

public class MergeSort {

    public static void main(String[] args) {
        int[] unsortedArray;
        int[] sortedArray;
        unsortedArray = new int[] {6,7,54,8,6,4,0,342,5,3,32,34,5,32,1,34,46,46,32,13,32,34,35,-654};
        sortedArray = mergeSort(unsortedArray);
                
        for (int element : sortedArray) {
            System.out.print(element + " ");
        }
    }

    public static int[] mergeSort(int[] unsortedArray) {
        // recursive merge sort algorithm
        int inputLength = unsortedArray.length;

        // split array into 2 arrays that diff by <= 1
        int[] arrayA = Arrays.copyOfRange(unsortedArray, 0, inputLength/2);
        int[] arrayB = Arrays.copyOfRange(unsortedArray, inputLength/2, inputLength);
        int[] sortedArray = new int[inputLength];
        
        // continue to split arrays until they are both diff by <= 1
        if (arrayA.length > 1 || arrayB.length > 1){
            arrayA = mergeSort(arrayA);
            arrayB = mergeSort(arrayB);
        }
        
        int i = 0;
        int j = 0;
        for (int element : sortedArray){
            // if 1 array is already used up just keep adding other array);
            if (i==arrayA.length){
                element = arrayB[j];
                j++;
                continue;
            } else if (j==arrayB.length){
                element = arrayA[i];
                i++;
                continue;
            }
            
            // add the lesser array element to the sorted array
            if (arrayA[i] < arrayB[j]){
                element = arrayA[i];
                i++;
            } else {
                element = arrayB[j];
                j++;
            }
        }

        return sortedArray;
    }
}
@@ -626,32 +626,37 @@
 ys that diff by 
+size 
 %3C= 1%0A        int
@@ -925,18 +925,15 @@
 oth 
-diff by %3C=
+size of
  1%0A 
@@ -1811,8 +1811,9 @@
 %0A    %7D%0A%7D
+%0A

clarify comments