MergeSort

#include<stdio.h>

void Merge(int arr[],int start,int mid,int end)
{
    int i=start, j=mid+1, k=start;
    int sort[end-start+1];
    while(i<=mid && j<=end)
    {
        if(arr[i]<=arr[j])
        {
            sort[k++]=arr[i++];
        }
        else if(arr[i]>arr[j])
        {
            sort[k++]=arr[j++];
        }
    }

    while(i<=mid)
    {
        sort[k++]=arr[i++];
    }

    while(j<=end)
    {
        sort[k++]=arr[j++];
    }

    for(int q=start; q<k; q++)
    {
        arr[q]=sort[q];
    }
}

void MergeSort(int arr[],int start,int end)
{
    if(start==end)
    {   return;
    }
    int mid=(start+end)/2;
    MergeSort(arr,start,mid);
    MergeSort(arr,mid+1,end);
    Merge(arr,start,mid,end);
}
int main()
{
    int arr[8]= {35,50,15,25,80,20,90,45};
    MergeSort(arr,0,7);
    for(int t=0; t<8; t++)
    {
        printf("%d ",arr[t]);
    }
    return 0;
}