头文件<stdlib.h>
一、qsort()是用来排序的,原型如下:
void qsort(void *base, size_t num, size_t size, int(*compare)(const void*,const void*));
- void *base:任意类型的数组
- size_t size:指数组元素的个数
- size_t size:每一个元素的大小
- 最后一个参数:是一个比较函数
代码示例1:对一个整型数组进行排序
int compare(const void* a,const void*b)
{
int *pa = (int *)a;
int *pb = (int *)b;
int num1= *pa;
int num2 = *pb;
return num2 - num1; //从大到小排,num1 - num2 是从小到大排
}
int main()
{
int arr[8] = {8,3,5,4,6,7,1,2};
qsort(arr,8,sizeof(int),compare);
return 0;
}
代码示例2:对一个结构体进行排序
首先说一下下面遇到的函数:
int fscanf(文件指针,格式字符串,输入列表);
struct Student
{
char name[30];
int chinese;
int math;
int English;
};
Student student[7];
void readData()
{
FILE *file = fopen("C:\\mark.txt","r"); //从文件中读取数据
for(int i=0; i<7; i++) //假设有七条数据
{
fscanf(file,"%s",student[i].name);
fscanf(file,"%d",&student[i].chinese);
fscanf(file,"%d",&student[i].math);
fscanf(file,"%d",&student[i].English);
}
fclose(file);
}
void displayData()
{
for(int i=0; i<7; i++)
{
printf("%s\t",student[i].name);
printf("%d\t",student[i].chinese);
printf("%d\t",student[i].math);
printf("%d\n",student[i].English);
}
}
int compare(const void* a,const void*b)
{
Student *pa = (Student *)a;
Student *pb = (Student *)b;
int num1 = pa->chinese;
int num2 = pb->chinese;
return num2 - num1;
}
int main()
{
readData();
qsort(student,7,sizeof(Student),compare);
displayData();
return 0;
}
二、bsearch()用来查找:它是二分查找法,它有一个前提条件:这个数组必须是按照某种顺序排列的
原型如下:
void *bsearch(const void *key, const void* base, size_t num, size_t size, int(compare)(const void*, const void*));
int *compare(const void *key, const void *pelem);
- const void *key:是要查找对象的地址
- const void *base:被查找的数组
- size_t num:数组的元素
- size_t size:每个元素的大小
- compare:bsearch中的compare和qsort中的compare是不同的,该函数中compare的第一个参数是我们传进去的key要和数组中本身的元素pelem进行比较
示例代码如下:
struct Student
{
char name[30];
int chinese;
int math;
int English;
};
Student student[7];
void readData()
{
FILE *file = fopen("C:\\mark.txt","r");
for(int i=0; i<7; i++) //假设有七条数据
{
fscanf(file,"%s",student[i].name);
fscanf(file,"%d",&student[i].chinese);
fscanf(file,"%d",&student[i].math);
fscanf(file,"%d",&student[i].English);
}
fclose(file);
}
void displayData()
{
for(int i=0; i<7; i++)
{
printf("%s\t",student[i].name);
printf("%d\t",student[i].chinese);
printf("%d\t",student[i].math);
printf("%d\n",student[i].English);
}
}
int compare2(const void *key,const void *e)
{
int *pNum1 = (int *)key; //先把它转换成int *的指针
int num1 = *pNum1; //然后在把它转成整型值
Student *pS = (Student *)e;
int num2 = pS->chinese;
return num2 - num1;
}
int main()
{
int arr[8] = {8,3,5,4,6,7,1,2};
readData();
qsort(student,7,sizeof(Student),compare);
int score = 99;
Student* name = (Student *)bsearch(&score,student,7,sizeof(Student),compare2);
cout<<name->name<<endl;
displayData();
return 0;
}