algo. merge_sort

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] q = new int[n];
        
        for (int i = 0; i < n; i++) {
            q[i] = sc.nextInt();
        }
        
        merge_sort(q, 0, n - 1);
        
        for (int i = 0; i < n; i++) {
            System.out.print(q[i] + " ");
        }
    }
    
    public static void merge_sort(int[] q, int l, int r) {
        if (l >= r) return;
        int mid = l + r >> 1;
        
        merge_sort(q, l, mid);
        merge_sort(q, mid + 1, r);
        
        int[] tmp = new int[r- l + 1];
        int i = l, j = mid + 1, k = 0;
        
        // merge left & right arrays
        while (i <= mid && j <= r) {
            if (q[i] < q[j]) {
                tmp[k++] = q[i++];
            }
            else tmp[k++] = q[j++];
        }
        while (i <= mid) {
            tmp[k++] = q[i++];
        }
        while (j <= r) {
            tmp[k++] = q[j++];
        }
        
        for (int n = l, m = 0; n <= r; n++, m++) {
            q[n] = tmp[m];
        }
    }
}