What is wrong with this code

#1

#include
using namespace std;
void merge(long longarr,int s,int e)
{ int mid=(s+e)/2;
long longtemp=new long long[e];
int i=s;
int j=mid+1;
int k=s;
while(i<=mid && j<=e)
{
if(arr[i]<arr[j])
{
temp[k++]=arr[i++];
}
else
{
temp[k++]=arr[j++];
}
}
while(i<=mid)
{
temp[k++]=arr[i++];
}
while(j<=e)
{
temp[k++]=arr[j++];
}
for(int i=s;i<=e;i++)
{
arr[i]=temp[i];
}
}
void mergesort(long long arr[],int s,int e)
{
if(s>=e)
{
return;
}
int mid=(s+e)/2;
mergesort(arr,s,mid);
mergesort(arr,mid+1,e);
merge(arr,s,e);
}
int main() {
int n;
cin>>n;
long long*arr=new long long[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int s=0;
int e=n-1;
mergesort(arr,0,n-1);
for(int i=0;i<n;i++)
{
cout<<arr[i]<<" ";
}
return 0;
}

#2

@Kunalgoyal merge function it should be *arr and given same data types to all it works


dont forget to hit like and mark resolved if cleared :smiley: