归并排序（数组）

数组的归并排序。

void merge(int vec[], int lo, int mid, int hi);

void mergeSort(int vec[], int lo, int hi)
{
	if(hi - lo < 2) return;
	int mid = (lo + hi) >> 1;
	mergeSort(vec, lo, mid);
	mergeSort(vec, mid, hi);
	merge(vec, lo, mid, hi);
}

void merge(int vec[], int lo, int mid, int hi)
{
	int * A = vec + lo;
	int lb = mid - lo; int * B = new int[lb];
	for(int i = 0; i < lb; i++)
		B[i] = vec[lo+i];
	int lc = hi - mid; int * C = vec + mid;

	for(int i = 0, j = 0, k = 0; (j < lb) || (k < lc); )
	{
		if(j < lb && (k >= lc || B[j] <= C[k])) A[i++] = B[j++];
		if(k < lc && (j >= lb || B[j] > C[k])) A[i++] = C[k++];
	}
	delete[] B;
}