数组中的逆序对（Java实现）

public class E51CountInversePairs {
    //数组中逆序对的数量
    public static int inversePairs(int[] data, int length) {
        if (data == null || length <= 0)
            return -1;

        int[] copy = new int[length];
        for (int i = 0; i < length; i++)
            copy[i] = data[i];

        return inversePairsCore(data, copy, 0, length - 1);
    }

    private static int inversePairsCore(int[] data, int[] copy, int start, int end) {
        if (start >= end) {
            copy[start] = data[start];
            return 0;
        }

        int mid = (end + start) / 2;
        //以此层部分排序的copy作为下一层递归的data，避免重复计算
        int left = inversePairsCore(copy, data, start, mid);
        int right = inversePairsCore(copy, data, mid + 1, end);

        int i = mid;
        int j = end;
        int k = end;
        int count = 0;
        while (i >= start && j >= mid + 1) {
            if (data[i] > data[j]) {
                copy[k--] = data[i--];
                count += j - mid;
            } else
                copy[k--] = data[j--];
        }
        for (; i >= start; i++) {
            copy[k--] = data[i--];
        }
        for (; j >= mid + 1; j--) {
            copy[k--] = data[j--];
        }

        return count + left + right;
    }

    //测试用例
    public static void main(String[] args){
        int[] data = {7, 5, 6, 4};
        System.out.println(E51CountInversePairs.inversePairs(data, 4)); //5
    }
}