Problem:- Click Here
#include<iostream>
using namespace std;
int a[200022];
int merge(int arr[],int l,int mid,int r)
{
int n1=mid-l+1;
int n2=r-mid;
int L[n1],R[n2];
for(int i=0;i<n1;i++)
L[i]=arr[l+i];
for(int i=0;i<n2;i++)
R[i]=arr[mid+1+i];
int i=0,j=0,k=l;
int inv3=0;
while(i<n1 && j<n2)
{
if(L[i]<=R[j])
{
arr[k]=L[i];
k++;
i++;
}
else
{
arr[k]=R[j];
k++;
j++;
inv3+=(mid-i+1);
}
}
while(i<n1)
{
arr[k]=L[i];
k++;
i++;
}
while(j<n2)
{
arr[k]=R[j];
k++;
j++;
}
return inv3;
}
int mergeSort(int arr[],int l,int r)
{
if(l<r)
{
int mid=(l+r)/2;
int inv1=mergeSort(arr,l,mid);
int inv2=mergeSort(arr,mid+1,r);
int inv3=merge(arr,l,mid,r);
return inv1+inv2+inv3;
}
else
return 0;
}
int main()
{
int t;
cin>>t;
int n;
string s;
while(t--)
{
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
int inv=mergeSort(a,0,n-1);
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
cout<<inv<<endl;
}
return 0;
}
Please help me in finding the bug. Thanks in advance !!!