Cod sursa(job #234515)
Utilizator | Lucian Boca amadaeus | Data | 21 decembrie 2008 01:38:19 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | Ascuns |
Compilator | c | Status | done |
Runda | Marime | 0.48 kb |
#include <stdio.h>
#include <stdlib.h>
unsigned int N, v[500010];
int sortf( const void *x, const void *y ) {
return *(unsigned int *)x - *(unsigned int *)y;
}
int main() {
int i;
freopen( "algsort.in", "r", stdin );
freopen( "algsort.out", "w", stdout );
scanf( "%d", &N );
for( i = 0; i < N; i++ ) {
scanf( "%u", &v[i] );
}
//qsort( v, N, sizeof( v[0] ), sortf );
//for( i = 1; i <= N; i++ ) {
// printf( "%u", v[i] );
//}
return 0;
}