基于CLRS的归并排序算法介绍，带倒置计数，基于C++

#include <iostream>
#include <vector>

using namespace std;

// 合并两个有序数组
void merge(vector<int>& nums, int left, int mid, int right, int& count) {
    vector<int> temp(right - left + 1);
    int i = left, j = mid + 1, k = 0;

    while (i <= mid && j <= right) {
        if (nums[i] <= nums[j]) {
            temp[k++] = nums[i++];
        } else {
            temp[k++] = nums[j++];
            count += mid - i + 1;  // 统计倒置对数
        }
    }

    while (i <= mid) {
        temp[k++] = nums[i++];
    }

    while (j <= right) {
        temp[k++] = nums[j++];
    }

    for (int p = 0; p < temp.size(); p++) {
        nums[left + p] = temp[p];
    }
}

// 归并排序
void mergeSort(vector<int>& nums, int left, int right, int& count) {
    if (left >= right) {
        return;
    }

    int mid = left + (right - left) / 2;
    mergeSort(nums, left, mid, count);
    mergeSort(nums, mid + 1, right, count);
    merge(nums, left, mid, right, count);
}

// 归并排序入口函数
vector<int> mergeSort(vector<int>& nums) {
    int count = 0;
    mergeSort(nums, 0, nums.size() - 1, count);
    return nums;
}

int main() {
    vector<int> nums = {5, 2, 6, 1, 3, 4};
    vector<int> sortedNums = mergeSort(nums);

    cout << "排序结果：";
    for (int num : sortedNums) {
        cout << num << " ";
    }
    cout << endl;

    cout << "倒置对数：" << count << endl;

    return 0;
}