Revise paste Merge sort

//Write a program that takes N integer from the user and print all the integers in ascending order:(By using merge sort)
#include<stdio.h>
void merge_sort(int* ,int ,int);
void Merge(int* ,int ,int ,int );
int main()
{
    int N,i,srt,mid,End;
    scanf("%d",&N);
    int arr[N];
    for(i=0;i<N;i++)
        scanf("%d",&arr[i]);
    srt=0,End=N-1;
    mid=(srt+End)/2;
    merge_sort(arr,srt,End);
    for(i=0;i<N;i++)
        printf("%d ",arr[i]);
    return 0;
}

void merge_sort(int A[],int s,int e)
{
    int m;
    if(s<e)//You can use if......else too[i.e. if(s>=e)return; else the tasks you have performed in if in current program
    {
        m=(s+e)/2;
        merge_sort(A,s,m);
        merge_sort(A,m+1,e);
        Merge(A,s,m,e);
    }
}

void Merge(int A[],int s, int m, int e)
{
    int j=s,k=m+1,l=s,B[e+1];
    while(j<=m && k<=e)
    {
        if(A[j]<=A[k])
            B[l++]=A[j++];
        else
            B[l++]=A[k++];
    }
    while(j<=m)
        B[l++]=A[j++];
    while(k<=e)
        B[l++]=A[k++];
    for(j=s;j<=e;j++)
        A[j]=B[j];
}