Pagini recente » Cod sursa (job #1512503) | Rating No Name Required (no_name_required) | Cod sursa (job #1287969) | Cod sursa (job #2099673) | Cod sursa (job #2216885)
#include <iostream>
using namespace std;
#include <fstream>
int a[1000],n;
int b[1000];
void ms(int i, int m, int j)
{
int x=i,y=m+1,k=1;
while (x<=m&&y<=j)
if(a[x]<a[y])
b[k++]=a[x++];
else
b[k++]=a[y++];
while (x<=m)
b[k++]=a[x++];
while (y<=j)
b[k++]=a[y++];
int t=i;
for(k=1;k<=(j-i)+1;k++)
a[t++]=b[k];
}
void dei (int i,int j)
{
if(i<j)
{ int m=i+(j-i)/2;
dei(1,m);
dei(m+1,j);
ms(i,m,j);
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
dei(1,n);
for(int i=1;i<=n;i++)
cout<<a[i]<<" ";
return 0;
}