Cod sursa(job #280194)
Utilizator | Irimescu Stefan wscsprint3r | Data | 13 martie 2009 11:38:45 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
//
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
long v[500001], i,inj,aux,sw,n;
int main()
{
f>>n;
for(i=0;i<n;i++)
f>>v[i];
inj=n;
while(inj>1)
{
inj/=2;
do{
sw=0;
for(i=0;i<n-inj;i++)
if(v[i]>v[i+inj])
{
aux=v[i];
v[i]=v[i+inj];
v[i+inj]=aux;
sw++;
}
}while(sw!=0);
}
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}