Cod sursa(job #1438124)
| Utilizator | Data | 19 mai 2015 00:52:54 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <stdio.h>
#include <stdlib.h>
FILE *f , *g;
int (*p) (int ,int);
int cmp(const void *a,const void *b)
{ return *((int*)a)- *((int*)b);
}
int main()
{ int v[100],n,i;
f=fopen("algsort.in","r");
g=fopen("algsort.out","w");
//printf(" n=");
fscanf(f,"%d",&n);
for(i=0; i<n ; i++)
fscanf(f,"%d",&v[i]);
//for(i=0;i<n;i++)
//v[i]=rand()%100;
//for(i=0;i<n;i++)
//fprintf(f,"%d ",v[i]);
qsort(v,n,sizeof(int),cmp);
//fprintf("\n\n\n\n");
for(i=0;i<n;i++)
fprintf(g,"%d ",v[i]);
return 0;
}
