Cod sursa(job #246290)
| Utilizator | Data | 20 ianuarie 2009 16:07:01 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<stdio.h>
long int v[500000],i,j,k;
int main()
{
FILE*in=fopen("algsort.in","r");
FILE*out=fopen("algsort.out","w");
fscanf(in,"%ld",&N);
for(i=1;i<=N;i++)
fscanf(in,"%ld",&v[i]);
while(modified)
{
modified=0;
for(i=2;i<=N;i++)
if(v[i]<v[i+1]) {
v[i]^=v[i+1]^=v[i]^=v[i+1];
modified=1;
}
}
for(i=1;i<=N;i++)
fprintf(out,"%ld ",v[i]);
fprintf(out,"\n");
fcloseall();
return 0;
}