Can anyone please explain why my Merge Sort code is not working; CPP; I used very Normal Approach but still its not working properly.
#include<iostream>
using namespace std;
void merge(int a[], int l, int mid, int r)
{ int p[r];
int i=l;
int j= mid+1;
int k=l;
while(i<=mid && j<=r)
{
if(a[i]<a[j])
{
p[k] = a[i];
i++;
}
else
{
p[k] = a[j];
j++;
}
k++;
}
for(k=l; k<=r; k++)
{
a[k]=p[k];
}
}
void ms(int a[], int l, int r)
{
if(l<r)
{
int mid = (l+r)/2;
ms(a,l,mid);
ms(a, mid+1, r);
merge(a,l,mid,r);
}
}
int main()
{
int a[]={1,9,4,6,2,7};
int l=0; int r=5;
ms(a,l,r);
for(int i=0; i<=r; i++)
{
cout<<a[i];
}
return 0;
}
I learned this code from a youtube tutorial: https://www.youtube.com/watch?v=aDX3MFL0tYs
Its output should be 1,2,4,6,7,9 but it is showing 102700, please help.