目录
整数:
qsort(数组名,数组元素个数,单位长度,自定义的比较函数的名字)
int main()
{
int arr[10] = { 9,8,7,6,5,4,3,2,1,0 };
qsort(arr, sizeof(arr) / sizeof(arr[0]), sizeof(arr[0]), cmp);
}
大于0交换前后两个数,小于等于0不交换,所以
int cmp(const void* a, const void* b)
{
return (*(int*)a - *(int*)b);
}
整数总代码:
#include<stdio.h>
#include<stdlib.h>
int cmp(const void* a, const void* b)
{
return (*(int*)a - *(int*)b);
}
int main()
{
int arr[10] = { 9,8,7,6,5,4,3,2,1,0 };
qsort(arr, sizeof(arr) / sizeof(arr[0]), sizeof(arr[0]), cmp);
for (int i = 0; i < sizeof(arr) / sizeof(arr[0]); i++)
{
printf("%d ", arr[i]);
}
return 0;
结构体:
定义结构体和初始化结构体
struct Stu
{
char name[20];
int age;
float score;
};
int main()
{
struct Stu s1[] = { {"ahangsan",20,10.5f},{"bisi",10,30.5f} };
}
加入qsort函数
int cmp(const void* a, const void* b)
{
return ((struct Stu*)a)->age - ((struct Stu*)b)->age;
}
int main()
{
struct Stu s1[] = { {"ahangsan",20,10.5f},{"bisi",10,30.5f} };
int ch = sizeof(s1) / sizeof(s1[0]);
qsort(s1, ch, sizeof(s1[0]), cmp);
}
结构体总代码:
#include<stdio.h>
#include<stdlib.h>
struct Stu
{
char name[20];
int age;
float score;
};
int cmp(const void* a, const void* b)
{
return ((struct Stu*)a)->age - ((struct Stu*)b)->age;
};
int main()
{
struct Stu s1[] = { {"ahangsan",20,10.5f},{"bisi",10,30.5f} };
int ch = sizeof(s1) / sizeof(s1[0]);
qsort(s1, ch, sizeof(s1[0]), cmp);
for (int i = 0; i < ch; i++)
{
printf("%s %d %f\n", s1[i].name, s1[i].age, s1[i].score);
}
return 0;
}
注意:
结构体struct的定义必须在自定义的比较函数之前,否则会报错“结构体未定义”;