Cod sursa(job #1253849)
| Utilizator | Data | 1 noiembrie 2014 21:23:48 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include "stdio.h"
FILE *f, *g;
int a[500000];
int n;
int main() {
f = fopen("algsort.in", "r");
g = fopen("algsort.out", "w");
fscanf(f, "%d", &n);
for(int i = 0; i < n; i++)
fscanf(f, "%d", &a[i]);
for(int i = 0; i < n-1; i++)
for(int j = i+1; j < n; j++)
{
if(a[i] > a[j])
{
int aux = a[i];
a[i] = a[j];
a[j] = aux;
}
}
for(int i = 0; i < n; i++)
fprintf(g, "%d ", a[i]);
fclose(f);
fclose(g);
return 0;
}