Pagini recente » Cod sursa (job #854712) | Cod sursa (job #1928189) | Cod sursa (job #2826754) | Cod sursa (job #1144971) | Cod sursa (job #3253820)
#include <fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int n,v[500005],w[500005];
void interclaseaza(int st,int mid,int dr)
{
int i=st;
int j=mid+1;
int k=st-1;
while(i<=mid && j<=dr)
{
if(v[i]<v[j])
w[++k]=v[i++];
else
w[++k]=v[j++];
}
for(;i<=mid;i++)
w[++k]=v[i];
for(;j<=dr;j++)
w[++k]=v[j];
for(int i=st;i<=dr;i++)
v[i]=w[i];
}
void sorteaza(int st,int dr)
{
if(st<dr)
{
int mid=(st+dr)/2;
sorteaza(st,mid);
sorteaza(mid+1,dr);
interclaseaza(st,mid,dr);
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
sorteaza(1,n);
for(int i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}