Algorithm 03 : 合并两个有序数组

Question : Merge a sorted array of size n into another sorted array of size m+n.

问题：合并两个有序的数组，将一个长度为n的数组插入到指定的长度为m的数组中。

/**
  * @author YuHuang
  * @vision 2011-10-04
  * This program is only for algorithm training.
  *
  */

public class MergeArray {

        public static void doMerge(int[] aArray,int[] bArray,int lenOfaArray,int lenOfbArray) {
                int k=lenOfaArray+lenOfbArray;

                --lenOfaArray;
                --lenOfbArray;

                while(lenOfaArray>=0 && lenOfbArray>=0){
                        aArray[--k] = aArray[lenOfaArray]>bArray[lenOfbArray]?aArray[lenOfaArray--]:bArray[lenOfbArray--];
                }

                while(lenOfbArray>=0){
                        aArray[--k]=bArray[lenOfbArray--];
                }

        }

        public static void main(String[] args) {
                int[] aArray=new int[]{1,7,10,23,34,36,38,40,100,102,110,0,0,0,0,0,0};
                int[] bArray=new int[]{25,99,101,109,120,220};

                System.out.println("Before Merged - aArray : ");
                for(int elem : aArray){
                        System.out.print(elem+" ");
                }

                System.out.println();
                MergeArray.doMerge(aArray,bArray,11,6);

                System.out.println("After Merged - aArray : ");
                for(int elem : aArray){
                        System.out.print(elem+" ");
                }
                System.out.println();
        }
}

运行结果为：
Lab-Computer-0db2f6:JavaExercises labuser$ java MergeArray
Before Merged - aArray :
1 7 10 23 34 36 38 40 100 102 110 0 0 0 0 0 0
After Merged - aArray :
1 7 10 23 25 34 36 38 40 99 100 101 102 109 110 120 220