Cod sursa(job #1050239)
Utilizator | Data | 8 decembrie 2013 13:41:07 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int main(){
int a[10],aux,i,j,n;
FILE *f1, *f2;
f1 = fopen("algsort.in","r");
f2 = fopen("algsort.out","w");
fscanf(f1,"%d",&n);
for(i=1;i<=n;i++){
fscanf(f1,"%d",&a[i]);
}
for(i=1;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;
}
fprintf(f2,"%d ",a[i]);
}
fclose(f1);
fclose(f2);
}