统计逆序对数目

//计算数组data中[lo,hi)区间上逆序对数目,注意算法执行完后data数组已排序。复杂度:o(nlogn)
int revCount(int* data, int lo, int hi)
{
	int revC = 0;  if (hi - lo < 2) return 0;  int mi = (lo + hi) / 2;
	revC += revCount(data, lo, mi);   revC += revCount(data, mi, hi);
	int *A = data + lo;
	int lb = mi - lo; int *B = new int[lb];
	for (int i = 0; i < lb; B[i] = A[i++]);
	int lc = hi - mi; int *C = data + mi;
	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) || C[k] < B[j])) 
		{ 
			A[i++] = C[k++]; 
			revC += lb - j; 
		}
	}
	delete[]B;  return revC;
}