1 import java.util.*;
 2
 3 public class Merge_Sort {
 4
 5
 6 /*
 7 ******************************开始写代码******************************/
 8     static void merge_Sort(int[] arr){
 9         int length = arr.length;
10         int mid = length/2;
11         if(length > 1){
12             int[] left = Arrays.copyOfRange(arr, 0, mid);//复制左半部分
13             int[] right = Arrays.copyOfRange(arr, mid, length);//复制右半部分
14             merge_Sort(left);//递归左边
15             merge_Sort(right);//递归右边
16             merge(arr,left,right);//合并数组
17         }
18     }
19
20     static void merge(int[] result, int[] left, int[] right) {
21         int i = 0, l = 0, r = 0;
22         while(l < left.length && r < right.length){
23             if(left[l] < right[r] )
24                 result[i++] = left[l++];
25             else
26                 result[i++] = right[r++];
27         }
28         while(l < left.length){//若left数组剩余，则后面依次复制给result
29             result[i++] = left[l++];
30         }
31         while(r < right.length){//反之
32             result[i++] = right[r++];
33         }
34     }
35 /******************************结束写代码******************************/
36
37
38     public static void main(String[] args){
39         Scanner in = new Scanner(System.in);
40         int[] res;
41
42         int _a_size = 0;
43         _a_size = Integer.parseInt(in.nextLine().trim());//输入数组大小
44         int[] _a = new int[_a_size];
45         int _a_item;
46         for(int _a_i = 0; _a_i < _a_size; _a_i++) {
47             _a_item = Integer.parseInt(in.nextLine().trim());//输入数组
48             _a[_a_i] = _a_item;
49         }
50
51          merge_Sort(_a);
52         for(int _a_i=0; _a_i < _a.length; _a_i++) {
53             System.out.print(String.valueOf(_a[_a_i])+" ");
54         }
55
56     }
57 }