数组中的逆序对

#include<bits/stdc++.h>
using namespace std;

int inversePairsCore(int* data, int* copy, int start, int end);

int inversePairs(int* data, int length){
    if(data == NULL || length < 0){
        return 0;
    }
    int* copy = new int[length];
    for(int i=0; i< length; i++){
        copy[i] = data[i];
    }
    int count =inversePairsCore(data, copy, 0, length -1);
    delete[] copy;
    return count;
}

int inversePairsCore(int* data, int* copy, int start, int end){
    if(start == end){
        copy[start] = data[start];
        return 0;
    }
    int length = (end - start) /2;
    int left = inversePairsCore(copy, data, start, start+length);
    int right= inversePairsCore(copy, data, start+length+1, end);

    int i = start+length;
    int j = end;
    int indexCopy = end;
    int count = 0;
    while(i>= start && j >= start+length+1){
        if(data[i] > data[j]){
            copy[indexCopy--] = data[i--];
            count += j-start - length;
        } else{
            copy[indexCopy--] = data[j--];
        }
    }
    for(; i>= start; i--){
        copy[indexCopy--] = data[i];
    }
    for(; j>= start+length+1; j--){
        copy[indexCopy--] = data[j];
    }
    return left+right+count;
}
int main(){
    int tmp[] ={7, 5, 6, 4};
    int res = inversePairs(tmp, 4);
    cout<<res<<endl;
    return 0;
}