排序算法----归并排序

归并排序java代码实现：

public class MergeSort {

	public static void main(String[] args) {
		int[] arr = { 2, 3, 6, 1, 34, 32, 8, 65, 9, 24, 0, 2 };
		mergeSort(arr, 0, arr.length - 1);
		for (int i : arr) {
			System.out.print(i + ",");
		}
	}

	private static int[] mergeSort(int[] arr, int low, int hight) {

		int mid = (hight + low) / 2;
		if (low < hight) {
			mergeSort(arr, low, mid);
			mergeSort(arr, mid + 1, hight);
			merge(arr, low, mid, hight);
		}
		return arr;
	}

	private static void merge(int[] arr, int low, int mid, int hight) {

		int i = low;
		int j = mid + 1;
		int k = 0;
		int[] temp = new int[hight - low + 1];
		while (i <= mid && j <= hight) {
			if (arr[i] < arr[j]) {
				temp[k++] = arr[i++];
			} else {
				temp[k++] = arr[j++];
			}
		}
		while (i <= mid) {
			temp[k++] = arr[i++];
		}
		while (j <= hight) {
			temp[k++] = arr[j++];
		}
		for (int p = 0; p < temp.length; p++) {
			arr[p + low] = temp[p];
		}
	}
}