AcWing787.归并排序模板

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{
    static int n;
    static int N = 1000010;
    static int[] a =new int[N];     //存储读入的数据和最后的结果
    static int[] t = new int[N];    //存储某一次递归排序后的数据
    static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args)throws IOException {
        n = Integer.parseInt(in.readLine());
        String[] init = in.readLine().split(" ");
        
        //读入数据
        for (int i = 0; i < n; i++) a[i] = Integer.parseInt(init[i]);
        
        //归并排序
        merge_sort(a,0,n - 1);
        
        //输出结果
        for (int i = 0; i < n; i++) System.out.print(a[i] + " ");
        
        in.close();
    }
    public static void merge_sort(int a[],int l,int r){
        //当区间只有一个元素时返回,左右两边都返回然后开始递归
        if (l == r) return; //递归结束条件
        
        //将递归分成两部分
        int mid = l + r >> 1;
        merge_sort(a,l,mid);
        merge_sort(a,mid + 1,r);
        
        //将小的元素放到一个新的数组t中
        int k = 0,i = l,j = mid + 1;
        while (i <= mid && j <= r)
            if (a[i] < a[j]) t[k ++] = a[i ++];
            else t[k++] = a[j ++];
        
        //剩余没放的元素直接放入t即可
        while (i <= mid) t[k++] = a[i ++];
        while (j <= r) t[k++] = a[j ++];
        
        //最后将t里的数据还给a
        //注意a数组是从是从l（左边界）开始赋值,t数据是从0开始
        for(i = l,j = 0;i <= r;) a[i++] = t[j++]; 
    }
}