用归并排序求逆序对

不多解释，常规算法，直接上代码，只是为了以后想起来时做参考~

#include <iostream>

#include <cassert>
using namespace std;

//记录逆序对的个数

int times = 0;

//子函数，用于完成核心功能：即将两个有序数组进行合并

void merge(int *arr1, int len1, int *arr2, int len2) {
int * result = new int[len1 + len2];
int count = 0;
int i = 0;
int j = 0;
for (i = 0; i < len1 + len2; i++) {
result[i] = 0;

}

//做循环，直到有一个数组中的所有元素已经被处理完

for (i = 0, j = 0;i < len1 && j < len2;) {

while (arr1[i] > arr2[j] && j < len2) {

//如果arr1[i] > arr2[j], 那么arr1中从i到len-1位置上所有的元素都比arr2[j]来得到，这一共有len1-i个元素，即有len1-i个逆序对

times += (len1 - i);//这一行是关键
cout << "times = " << times << endl;
for (int k = 0; k < len1 - i; k++) {
cout << "value: (" << arr1[i + k] << ", " << arr2[j] << ")" << endl;
}
result[count++] = arr2[j++];

}
while (arr1[i] <= arr2[j] && i < len1) {
result[count++] = arr1[i++];
}
}
assert(count <= len2 + len1);
while (i < len1) {
result[count++] = arr1[i++];
}
assert(i == len1);
while (j < len2) {
result[count++] = arr2[j++];
}
assert(j == len2);


assert(count == len1 + len2);
count = 0;
assert(count == 0);
for (i = 0; i < len1; i++) {
arr1[i] = result[count++];
}
for (j = 0; j < len2; j++) {
arr2[j] = result[count++];
}
assert(count == len1 + len2);
delete[] result;
result = NULL;

}

//归并排序

void mergeSort(int *arr1, int len1, int *arr2, int len2) {

assert(len1 >= 0 || len2 >= 0);

//先对arr1本身进行归并排序

if (len1 > 1) {
int mid1 = (len1 + 1) / 2;
mergeSort(arr1, mid1, arr1 + mid1, len1 - mid1);

}

//在对arr2本身进行归并排序

if (len2 > 1) {
int mid2 = (len2 + 1) / 2;
mergeSort(arr2, mid2, arr2 + mid2, len2 - mid2);

}

//此时，arr1和arr2都分别已经是有序数组，所以调用merge函数，将这两个有序数组进行合并

merge(arr1, len1, arr2, len2);

}

//面向客户的可调用的归并算法

void mergeSort(int *arr, int length) {
int mid = (1 + length) / 2;
mergeSort(arr, mid, arr + mid, length - mid);
}
#define TEST_FIND
#ifdef TEST_FIND


void main() {


int length = 14;
int arr[] = {1, 9, 0, 6, 7, 8, 4, 5, 3, 2, 0, 1, 99, 100};
cout << "orignal array: " << endl;
for (int i = 0; i < length; i++) {
cout << arr[i] << "  ";
}
cout << endl;


mergeSort(arr, length);


cout << "result: " << endl;
for (int i = 0; i < length; i++) {
cout << arr[i] << "  ";
}
cout << endl;


}
#endif // TEST