Cod sursa(job #280141)
Utilizator | Vlad Schnakovszki shnako | Data | 13 martie 2009 11:08:03 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <stdio.h>
FILE *f, *g;
long v[50001], i, n, inj, sw, aux;
void shell(void)
{
inj=n;
while (inj>1)
{
inj/=2;
sw=0;
while (!sw)
{
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;
}
}
}
}
int main(void)
{
f=fopen("shell.in", "r");
g=fopen("shell.out", "w");
fscanf(f, "%ld", &n);
for (i=1;i<=n;i++)
fscanf(f, "%ld", &v[i]);
shell();
for (i=1;i<=n;i++)
fprintf(g, "%ld ", v[i]);
fcloseall();
return 0;
}