Cod sursa(job #2219733)
| Utilizator | Data | 9 iulie 2018 17:00:39 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdlib.h>
#include <stdio.h>
#define MAX_N 10000
int n, v[MAX_N];
int cmp(const void* x,const void *y);
int main(int argc, char *argv[])
{
int i;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i = 0; i < n; i++ )
scanf("%d",v+i);
qsort(v,n,sizeof(v[0]),cmp);
for(i = 0; i < n; i++)
{
printf("%d ",v[i]);
}
return 0;
}
int cmp(const void*x, const void *y )
{
return *(int*)x - *(int*)y;
}
