非递归实现归并排序

Posted 2022-11-26 ssdut_yrp

归并算法的中心是归并两个已经有序的数组

public class MergeApp 
    /**
     * @param args
     */
    public static void main(String[] args) 
        // TODO Auto-generated method stub
        int[] arrayA=23,47,81,95;
        int[] arrayB=7,14,39,55,62,74;
        int[] arrayC=new int[10];
        merge(arrayA, 4, arrayB, 6, arrayC);
        display(arrayC, 10);
    

    public static void merge(int[] arrayA,int sizeA,int[] arrayB,int sizeB,int[] arrayC)
        int aDex=0,bDex=0,cDex=0;
        while(aDex<sizeA&&bDex<sizeB)//neither array empty
            if(arrayA[aDex]<arrayB[bDex])
                arrayC[cDex++]=arrayA[aDex++];
            
            else
                arrayC[cDex++]=arrayB[bDex++];
            
        
        while(aDex<sizeA)//arrayB is Empty
            arrayC[cDex++]=arrayA[aDex++];
        
        while(bDex<sizeB)
            arrayC[cDex++]=arrayB[bDex++];
        
    

    public static void display(int[] theArray,int size)
        for(int j=0;j<size;j++)
            System.out.print(theArray[j]+" ");
        
        System.out.println("");