归并排序

public class MergeSort {
	
	//合并
	private static void mergeSort(int[] array, int i, int mid, int j) {
		int length = j-i+1;
		int m = mid - 1;
		int n = mid;
		int k = i;
		int[] tempArray = new int[array.length];
		
		while(i<=m && n<=j) {
			if(array[i]<array[n]) {
				tempArray[k++] = array[i];
				i++;
			} else if(array[i]>array[n]) {
				tempArray[k++] = array[n];
				n++;
			} else if(array[i]==array[n]) {
				tempArray[k++] = array[i];
				i++;
				n++;
			}
		}
		
		while(i<=m) {
			tempArray[k++] = array[i++];
		}
		while(n<=j) {
			tempArray[k++] = array[n++];
		}
		
		for (int l = 0; l < length; l++, j--) {
			array[j] = tempArray[j];
		}
	}

	//分治
	public static void partation(int[] array, int i, int j) {
		if(i>=j){
			return;
		}
		int mid = (i+j)/2;
		partation(array, i, mid);
		partation(array, mid+1, j);
		mergeSort(array, i, mid+1, j);
	}
	
	public static void main(String args[]) {
//		int[] array = {52,26,97,19,66,8,49};
		int[] array = {10,4,6,3,8,2,5,7};
		partation(array, 0, array.length-1);
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i]+ "  ");
		}
	}
}

归并排序思想：将两个有序表合并成一个有序表，先分治后把已有序的两个表归并。