归并排序

package sortAlgorithm;

public class MergeSort {
public static void main(String[] args){
	int[] array={2,2,2};
	mergeSort(array);
	print(array);
}

private static void print(int[] array) {
	// TODO Auto-generated method stub
	for(int i=0;i=secondHalf[second])
			{
			mergeArray[result]=secondHalf[second];
			second++;		
			}
		else{
			mergeArray[result]=firstHalf[first];
			first++;		
		}
		result++;	
	}
		//判断跳出，若是first>second ,说firstHalf 已经载入mergeArray,只需要将secondHalf中second 到secondLength 的数据载入即可
	
	if(first>second)
	{
		for(int i=second;i