排序算法---归并排序

import java.util.*;
// 1:无需package
// 2: 类名必须Main, 不可修改

public class Main {
    static int[] mergeArr;
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[] arr = new int[n];
        mergeArr = new int[n];
        for(int i =0;i<n;i++){
            arr[i] = input.nextInt();
        }
        mergeSort(arr,0,n-1);
        System.out.println(Arrays.toString(arr));
    }
    public static void mergeSort(int[] arr,int l,int r){
        if(l<r){
            int mid = l+(r-l)/2;
            mergeSort(arr,l,mid);
            mergeSort(arr,mid+1,r);
            merge(arr,l,mid,r);
        }
    }
    public static void merge(int[] arr,int l,int mid,int r){
        mergeArr = Arrays.copyOf(arr,arr.length);
        int i = l,j = mid+1,k = l;
        while(i<=mid && j<=r){
            if(mergeArr[i]<=mergeArr[j]){
                arr[k++] = mergeArr[i++];
            }
            else{
                arr[k++] = mergeArr[j++];
            }
        }
        while(i<=mid){
            arr[k++] = mergeArr[i++];
        }
    }
}