mergesort

#include <iostream>
using namespace std;
void sortare(int v[],int s,int d)
{
    if(v[s]>v[d])
        swap(v[s],v[d]);
}
void interclasare(int v[],int s,int d,int m)
{
    int i,j,k,u[100];
    i=s;j=m+1;k=0;
    while(i<=m &&j<=d)
    {
        if(v[i]<v[j])
        {
            k++;
            u[k]=v[i];
            i++;
        }
        else
        {
            k++;
            u[k]=v[j];
            j++;
        }
    }
    if(i<=m)
        for(j=i;j<=m;j++)
        {
            k++;
            u[k]=v[j];
        }
    if(j<=d)
        for(i=j;i<=d;i++)
        {
            k++;
            u[k]=v[i];
        }
        k=1;
        for(i=s;i<=d;i++)
        {
            v[k]=u[k];
            k++;
        }
}
void merge_sort(int v[],int s,int d)
{
    int m;
    if(d-s<=1)
        sortare(v,s,d);
    else
    {
        m=s+d/2;
        merge_sort(v,s,m);
        merge_sort(v,m+1,d);
        interclasare(v,s,d,m);
    }
}
int main()
{
    int v[100],n,i;
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>v[i];
    merge_sort(v,1,n);
    for(i=1;i<=n;i++)
        cout<<v[i]<<" ";
    return 0;
}