Envío 4532

Código

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc= new Scanner(System.in);
        int N = sc.nextInt();
        int numberArray[] = new int[N];
        for(int i = 0; i < N; i++)
        {
            numberArray[i] = sc.nextInt();
        }
        sc.close();
        
		// MergeSort      
        Main mergeSort = new Main();
        mergeSort.sort(numberArray, 0, numberArray.length - 1);
		
        for(int i = 0; i < numberArray.length; i++) {
            System.out.print(numberArray[i] + " ");
          }
	}

	void sort(int numberArray[], int lowIndex, int highIndex)
    {
        if (lowIndex < highIndex) {
            int middlePoint = lowIndex + (highIndex - lowIndex) / 2;
            sort(numberArray, lowIndex, middlePoint);
            sort(numberArray, middlePoint + 1, highIndex);
            merge(numberArray, lowIndex, middlePoint, highIndex);
        }
    }
	
	void merge(int numberArray[], int lowIndex, int middlePoint, int highIndex)
	    {
	        int size1 = middlePoint - lowIndex + 1;
	        int size2 = highIndex - middlePoint;
	        int L[] = new int[size1];
	        int R[] = new int[size2];
	        for (int i = 0; i < size1; ++i)
	            L[i] = numberArray[lowIndex + i];
	        for (int j = 0; j < size2; ++j)
	            R[j] = numberArray[middlePoint + 1 + j];

	        int i = 0, j = 0;
	        int k = lowIndex;
	        while (i < size1 && j < size2) {
	            if (L[i] <= R[j]) {
	                numberArray[k] = L[i];
	                i++;
	            }
	            else {
	                numberArray[k] = R[j];
	                j++;
	            }
	            k++;
	        }
	 
	        while (i < size1) {
	            numberArray[k] = L[i];
	            i++;
	            k++;
	        }
	 
	        while (j < size2) {
	            numberArray[k] = R[j];
	            j++;
	            k++;
	        }
	    }
}