o_195h4n6al16jb186b1b2qs7fgssa.pdf

with the key
Remarks: qsortoverwrites the array with the sorted array. The comparison
function is supplied by the user. Inthe following example, the list is
sorted according to the comparison function. This compuses
ascending order.
Example: #include /* for qsort */
#include /* for printf */
#define NUM 7
int comp(const void *e1,const void *e2);
int main(void)
{
int list[NUM] = {35, 47, 63, 25, 93, 16, 52};
int x;
printf("Unsorted List: ");
for (x = 0; x < NUM; x++)
printf("%d ", list[x]);
qsort(list, NUM, sizeof(int), comp);
printf("\n");
printf("Sorted List: ");
for (x = 0; x < NUM; x++)
printf("%d ", list[x]);
}
int comp(const void *e1,const void *e2)
{
const int * a1 = e1;
const int * a2 = e2;
if (*a1 < *a2)
return -1;
else if (*a1 == *a2)
return 0;
else
return 1;
}
Output:
Unsorted List: 35 47 63 25 93 16 52
Sorted List: 16 25 35 47 52 63 93
Ví dụ: # include / * Forprintf * /
# include / * Cho rand, srand * /
int main (void)
{
int x;
srand (7);
for (x = 0; x