Cod sursa(job #254764)
Utilizator | Data | 7 februarie 2009 14:42:11 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
int main(void){
long n,i,j,aux,a[10000];
FILE *in=fopen("algsort.in","rt"),*out=fopen("algsort.out","w+");
fscanf(in,"%ld",&n);
for(i=0;i<n;i++)
fscanf(in,"%ld",&a[i]);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j]){
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=0;i<n;i++)
fprintf(out,"%ld ",a[i]);
return 0;
}