如果数组长度为 100000，则使用合并排序对反转进行计数会给出负数

我仍然是编程的初学者，我正在参加在线课程(算法(

其中一个练习题是计算包含随机排序的 100000 个数字的文件中的反转次数。我已经在小数据集上尝试过这段代码，它工作正常，但是当传递实际数据集时，它会以负数给出反转计数。尝试了来自不同平台的各种解决方案，但仍然无法解决。

所以这是我的代码

#include "stdafx.h"
#include <iostream>;
#include <conio.h>:
#include <fstream> 
using namespace std;
long merge(int a[], int start, int mid, int end) 
int i = start; 
int j = mid + 1; 
int k = start; 
int inversion=0;
int temp[100000];
while (i <= mid && j <= end)
{
if (a[i] < a[j])  
{
temp[k++] = a[i++]; 
}
else 
{
temp[k++] = a[j++]; 
inversion =inversion + (mid - i);
}
}
while (i <= mid) 
{
temp[k++] = a[i++]; 
}
while (j <= end) 
{
temp[k++] = a[j++]; 
}
for (int i = start; i <= end; i++)
{
a[i] = temp[i]; 
}
return inversion;
long Msort(int a[], int start,int end)
{
if (start >= end)
{
return 0;
}
int inversion = 0;
int mid = (start + end) / 2;
inversion += Msort(a, start, mid);
inversion += Msort(a, mid + 1, end); 
inversion += merge(a, start, mid, end)
return inversion;
}
long ReadFromFile(char FileName[], int storage[],int n)
{
int b;
int count=0;
ifstream get(FileName);
if (!get)
{
cout << "no file found";
}
while (!get.eof())
{
get >> storage[count];
count++;
}
b = count;
return b;
}
int main()
{
int valuescount = 0;
int arr[100000];
char filename[] = { "file.txt" };
long n = sizeof(arr) / sizeof(arr[0]);
valuescount=ReadFromFile(filename, arr,n);
int no_Of_Inversions = Msort(arr, 0, valuescount -1);
cout << endl << "No of inversions are" << 't' << no_Of_Inversions <<'t';
cout <<endl<< "Total no of array values sorted"<< valuescount<<endl;
system("pause");
}
`