Cod sursa(job #273532)
| Utilizator | Data | 8 martie 2009 18:36:42 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[100],n,i,inj,sw,aux;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
inj=n;
while(inj>1)
{
inj/=n;
do
{sw=1;
for(i=1;i<=n-inj;i++)
if(v[i]>v[i+inj])
{
aux=v[i];
v[i]=v[i+inj];
v[i+inj]=aux;
sw=0;
}
}while(!sw);
}
for(i=1;i<=n;i++)
g<<v[i]<<' ';
f.close();
g.close();
return 0;
}
