java-数据结构-归并排序-工具类

package itheima05;

public class Merging {
	private static Comparable[] assist;

	public static void sort(Comparable[] a) {
		assist = new Comparable[a.length];

		int low = 0;
		int high = a.length - 1;
		sort(a, low, high);

	}

	public static void sort(Comparable[] a, int low, int high) {
		if (low >= high) {
			return;
		}

		int mid = low + (high - low) / 2;
		sort(a, low, mid);
		sort(a, mid + 1, high);
		merge(a, low, mid, high);
	}

	public static void merge(Comparable[] a, int low, int mid, int high) {
		int i = low;
		int p1 = low;
		int p2 = mid + 1;
		while (p1 <= mid && p2 <= high) {
			if (judge(a[p1], a[p2])) {
				assist[i++] = a[p1++];
			} else {
				assist[i++] = a[p2++];
			}
		}
		while (p1 <= mid) {
			assist[i++] = a[p1++];
		}
		while (p2 <= high) {
			assist[i++] = a[p2++];
		}

		for (int index = low; index <= high; index++) {
			a[index] = assist[index];
		}
	}

	public static boolean judge(Comparable s1, Comparable s2) {
		return s1.compareTo(s2) < 0;
	}

	public static void  exchange(Comparable[] a, int i, int j) {
		Comparable temp = a[i];
		a[i] = a[j];
		a[j] = temp;
	}

}