Cod sursa(job #273544)
| Utilizator | Data | 8 martie 2009 18:46:04 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
int v[100],n,i,inj,sw,aux;
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
scanf("%d ", &n);
for (i = 1; i <= N; i++)
scanf("%d ", &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++)
printf("%d ", v[i]);
return 0;
}
