Cod sursa(job #871922)
Utilizator | Data | 5 februarie 2013 15:49:03 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
#include <stdlib.h>
int cmp (const int *a, const int *b)
{
return *(int*)a - *(int*)b;
}
int main()
{
FILE *in,*out;
in = fopen("algsort.in","r");
int N,i;
fscanf(in,"%d",&N);
int a[N];
for ( i = 0; i < N; i++ )
fscanf(in,"%d",&a[i]);
fclose(in);
qsort(a, N, sizeof(a[0]), cmp);
out = fopen("algsort.out","w");
for ( i = 0; i < N; i++)
fprintf(out, "%d ", a[i] );
fclose(out);
return 0;
}