归并算法MergeSort

void mergesort(int* arr, int left, int right)
{
	if (right - left < 2)	return ;
	//if (right <=  left) return;
	//int mid = left + right >> 1;
	int mid = (right - left) / 2 + left;
	mergesort(arr, left, mid);
	mergesort(arr, mid, right);//这里不能用+1，如果+1，
									//那么arr[2]就不会改变
	merge(arr, left, mid, right);
}

void merge(int* arr, int left, int mid, int right)
{
	int* A = arr + left;
	int lb = mid - left; int* B = new int[lb + 1];
	int lc = right - mid; int* C = arr + mid;

	for (int i = 0; i < lb; B[i] = A[i++]);

	for (int i = 0, j = 0, k = 0; j < lb;)
	{
		/*if (k <= lc && C[k] < B[j])
			A[i++] = C[k++]; 不能相等*/
		if (k < lc && C[k] < B[j])
			A[i++] = C[k++];
		if (lc <= k || B[j] <= C[k])
			A[i++] = B[j++]; 
	}
	
	Print(arr);
	printf("\n");
	delete[] B;
}