Java--归并排序

import java.util.Scanner;

public class Main{
    static int N=100100;
    static int[] f=new int[N],tmp=new int[N];
    static int n;
    
    //归并排序
    private static void sort(int[] d, int l, int r){
        if(l>=r) return;
        
        int mid = ( l + r ) >> 1;
        
        sort(d , l , mid);
        sort(d , mid + 1 , r);
        
        int k = 0 , i = l , j = mid + 1;
        while(i <= mid && j <= r){
            if(f[i] < f[j]) tmp[k ++] = f[i ++];
            else tmp[k ++] = f[j ++];
        }
        while(i <= mid) tmp[k ++] = f[i ++];
        while(j <= r) tmp[k ++] = f[j ++];
        
        for(i = l,j = 0; i <= r;i++,j++) f[i] = tmp[j];
        
    }
    
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        n=sc.nextInt();
        
        for(int i = 0; i < n; i++) f[i] = sc.nextInt();
        
        sort(f , 0 , n - 1);
        
        for(int i = 0; i < n; i++) System.out.print(f[i]+" ");
    }
}