归并排序

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<array.length;i++)
		System.out.print(array[i]+" ");
	System.out.println();
	
}

private static void mergeSort(int[] array) {
	// TODO Auto-generated method stub
	if(array==null||array.length<=1)
		return;
	int firstLength=array.length/2;
	int[] firstHalf=new int[firstLength];
	System.arraycopy(array, 0, firstHalf, 0, firstLength);
	
	mergeSort(firstHalf);
	int secondLength=array.length-firstLength;
	int[] secondHalf=new int[secondLength];
	System.arraycopy(array, firstLength, secondHalf, 0,secondLength );
	mergeSort(secondHalf);
	
	int[] mergeArray=new int[array.length];
	merge(firstHalf,secondHalf,mergeArray);
	System.arraycopy(mergeArray, 0, array, 0, array.length);
	
	
	
}

private static void merge(int[] firstHalf, int[] secondHalf, int[] mergeArray) {
	// TODO Auto-generated method stub
	int first=0;
	int second=0;
	int result=0;
	while(first<firstHalf.length&&second<secondHalf.length){
		if(firstHalf[first]>=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<secondHalf.length;i++)
			{
			mergeArray[result]=secondHalf[i];
			result++;
			}
	}
	else
	{
		for(int i=first;i<firstHalf.length;i++)
			mergeArray[result]=firstHalf[i];
		result++;
	}
	
}
}