Cod sursa(job #709072)
Utilizator | Dinu Radu RaduGabriel2012 | Data | 7 martie 2012 17:24:40 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
int main()
{
int n,i,j;
int a[500005],x;
FILE *f,*g;
f=fopen("algsort.in","r");
g=fopen("algsort.out","w");
fscanf(f,"%d",&n);
for (i=1;i<=n;i++) fscanf(f,"%d",&a[i]);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (a[i]<a[j]) {x=a[i];a[i]=a[j];a[j]=x;}
for (i=1;i<=n;i++) fprintf(g,"%d ",a[i]);
fclose(f);
fclose(g);
return 0;
}