1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46
| #include <stdio.h>
#include <time.h>
int compare ( const int * x, const int * y );
int main ( void ) {
int i, num;
int k = 1;
int array[50];
srand (time (NULL));
for (i = 0; i < 50; i++){
array[i] = rand () %200;
}
qsort ( array, 50, sizeof ( int ), compare );
for ( i = 0; i < 16; i++) {
if( array[i] < 1000 ) {
printf("%02d. array[%02d] = %d\t%02d. array[%02d] = %d\t %02d. array[%02d] = %d\n",
k, k, array[i],(k+17), (k+17), array[i+17],(k+34), (k+34), array[i+34]);
}
else {
printf("%02d. array[%02d] = %d\t%02d. array[%02] = %02d\tarray[%d] = %d\n",
k, k, array[i], (k+17), (k+17), array[i+17], (k+34), (k+34), array[i+34]);
}
k++;
}
printf("%02d. array[%02d] = %d\t%02d. array[%d] = %d\n",
k, k, array[i],(k+17), (k+17), array[i+17]);
printf("\n");
extracredit ();
return 0;
}
/* fonction qui compare chaque deux element pour changer */
/* la place de chacun */
int compare ( const int * x, const int * y )
{
if ( * x == * y ) return ( 0 );
else return ( * x > * y ) ? 1 : -1;
} |
Partager