统计c++中合并排序算法中的交换数量

#include <iostream>
using namespace std;

int count = 0;

void merge(int arr[], int left[], int leftSize, int right[], int rightSize) {
    int i = 0, j = 0, k = 0;
    while (i < leftSize && j < rightSize) {
        if (left[i] <= right[j]) {
            arr[k++] = left[i++];
        } else {
            arr[k++] = right[j++];
            count++; // 记录交换次数
        }
    }
    while (i < leftSize) {
        arr[k++] = left[i++];
    }
    while (j < rightSize) {
        arr[k++] = right[j++];
    }
}

int* mergeSort(int arr[], int size) {
    if (size <= 1) {
        return arr;
    }
    int mid = size / 2;
    int* left = mergeSort(arr, mid);
    int* right = mergeSort(arr + mid, size - mid);
    int* result = new int[size];
    merge(result, left, mid, right, size - mid);
    delete[] left;
    delete[] right;
    return result;
}

int main() {
    int arr[] = {5, 2, 8, 3, 1};
    int size = sizeof(arr) / sizeof(arr[0]);
    int* sortedArr = mergeSort(arr, size);
    cout << "Sorted array: ";
    for (int i = 0; i < size; i++) {
        cout << sortedArr[i] << " ";
    }
    cout << endl;
    cout << "Number of swaps: " << count << endl;
    delete[] sortedArr;
    return 0;
}