归并排序

int k=0;
while(i){
    if(a[i]b[j]) {
        c[k++]=a[i++];
    }
    else {
        c[k++]=b[j++];
    }
}
while(i) {
    c[k++]=a[i++];
}
while(j) {
    c[k++]=b[j++];
}

import java.util.*;

public class 归并排序 {
    
    static void Merge(int array[],int array1[],int s,int m,int t) {    //合并两个已排序好的子序列
        int i=s;
        int j=m+1;
        int k=s;
        while(it) {
            if(array[i]//将较小者放入array1
                array1[k++]=array[i++];
            }
            else {
                array1[k++]=array[j++];
            }
        }
        while(im) {
            array1[k++]=array[i++];
        }
        while(jt) {
            array1[k++]=array[j++];
        }
        //合并完毕后更新辅助数组的值
        for(int z=s;z) {
            array[z]=array1[z];
        }
    }
    
    static void MergeSort(int array[],int array1[],int s,int t) {
        if(s==t) {
            array1[s]=array[s];
        }
        else {
            int m=(s+t)/2;    //折半
            MergeSort(array,array1,s,m);    //合并前半段
            MergeSort(array,array1,m+1,t);    //合并后半段
            Merge(array1,array,s,m,t);
        }
        
    }

    public static void main(String[] args) {
        Scanner reader=new Scanner(System.in);
        System.out.print("Input the size of array：");
        int n=reader.nextInt();
        int array[]=new int[n];
        int array1[]=new int[n];    //辅助数组
        System.out.print("Input the element of array：");
        for(int i=0;i) {
            array[i]=reader.nextInt();
        }
        MergeSort(array,array1,0,n-1);
        for(int i=0;i) {
            System.out.print(array[i]+" ");
        }
    }

}