归并排序

package sort;

public class MergeSortDemo {
	private int[] arr1={1,2,3,4};
	private int[] arr2={0,6,7,8};
	private int[] arr3=new int[8];

	public MergeSortDemo(){

	}

	public void mergeSort(){
		int a1=0;
		int a2=0;
		int a3=0;
		while(a1<4&&a2<4){
			if(arr1[a1]>arr2[a2]){
				arr3[a3++]=arr2[a2++];
			}
			else{
				arr3[a3++]=arr1[a1++];
			}
		}
		if(a1!=4){
			while(a1<4){
			arr3[a3++]=arr1[a1++];
			}
		}
		else {
			while(a2<4){
				arr3[a3++]=arr2[a2++];
			}
		}
	}

	public void showResult(){
		for(int i:arr3)
			System.out.print(i+"  ");
	}
	public static void main(String[] args){
		MergeSortDemo so=new MergeSortDemo();
		so.mergeSort();
		so.showResult();
	}
}