Cod sursa(job #293982)
Utilizator | Miu Alexandra alexamiu2008 | Data | 2 aprilie 2009 11:16:15 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | infoexpert | Marime | 0.37 kb |
#include<stdio.h>
FILE*fin,*fout;
long int k ,n ,i,j,v[500000];
int main(){
fin=fopen("algsort.in","r");
fout=fopen("algsort.out","w");
fscanf(fin,"%ld\n",&n);
for(i=1;i<=n;i++){fscanf(fin,"%ld ",&v[i]);}
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){if(v[j]<v[i]){k=v[i];
v[i]=v[j];
v[j]=k;
}}
}
for(i=1;i<=n;i++){fprintf(fout,"%ld ",v[i]);}
return 0;
}