归并排序java

归并排序：从已经排好序的两堆数据中合并成一组排好序的数组

 

 

public static void main(String[] args) {
		int[] arr = {23, 2, 53, 13, 42, 56, 7, 8, 60, 21, 76};
		printArr(arr);
		mergeSort(arr, 0, arr.length-1);
		printArr(arr);
	}
	
	private static void printArr(int[] arr) {
		for(int i = 0; i < arr.length; i++) {
			System.out.print(arr[i] + " ");
		}
		System.out.println();
	}
	
	/**
	 * 归并排序
	 * @param arr
	 * @param front
	 * @param rear
	 */
	public static void mergeSort(int arr[], int front, int rear) {
		if(front < rear) {
			int mid = (front + rear) / 2;
			mergeSort(arr, front, mid);
			mergeSort(arr, mid+1, rear);
			merge(arr, front, mid, rear);
		}
	}
	
	public static void merge(int arr[], int front, int mid, int rear) {
		int i, j, k;
		int B[] = new int[rear+1];
		for(i = front; i <= rear; i++) {
			B[i] = arr[i];
		}
		
		for(i = front, j = mid+1, k = front; i <= mid && j <= rear; k++) {
			if(B[i] <= B[j]) {
				arr[k] = B[i++];
			}
			else {
				arr[k] = B[j++];
			}
		}
		while(i <= mid) arr[k++] = B[i++];
		while(j <= rear) arr[k++] = B[j++];
		
	}

结果：
23 2 53 13 42 56 7 8 60 21 76 
2 7 8 13 21 23 42 53 56 60 76