Cod sursa(job #1377822)
Utilizator | Data | 6 martie 2015 08:16:38 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <stdio.h>
#include <stdlib.h>
int v[500001];
int main()
{
FILE *fin, *fout;
int n, i, j, pahar;
fin=fopen("algsort.in", "r");
fout=fopen("algsort.out", "w");
fscanf(fin, "%d", &n);
for(i=1; i<=n; i++)
fscanf(fin, "%d", &v[i]);
for(i=1; i<n; i++)
for(j=i+1; j<=n; j++)
if(v[i]>v[j])
{
pahar=v[i];
v[i]=v[j];
v[j]=pahar;
}
for(i=1; i<=n; i++)
fprintf(fout, "%d ", v[i]);
fclose(fin);
fclose(fout);
return 0;
}