指针---五

---

前言

---

1.回调函数是什么？

回调函数就是⼀个通过函数指针调用的函数。
如果你把函数的指针（地址）作为参数传递给另⼀个函数，当这个指针被⽤来调⽤其所指向的函数时，被调用的函数就是回调函数。回调函数不是由该函数的实现方直接调用，而是在特定的事件或条
件发生时由另外的一方调用的，用于对该事件或条件进行响应。
咱们先再把上一篇的计算器代码再拿过来：

#include<stdio.h>
int Add(int x, int y)
{
	return x + y;
}
int Sub(int x,int y)
{
	return x - y;
}
int Mul(int x, int y)
{
	return x * y;
}
int Div(int x, int y)
{
	return x / y;
}
void menu()
{
	printf("***************************\n");
	printf("*******1.Add   2.Sub*******\n");
	printf("*******3.Mul   4.Div*******\n");
	printf("************5.Eixt*********\n");
	printf("***************************\n");
}
int main()
{
	int x, y;
	int ret = 0;
	int input = 0;
	do
	{
		menu();
		printf("请选择>");
		scanf("%d", &input);
		switch (input) {
		case 1:
			printf("请输入2个数");
			scanf("%d %d", &x, &y);
			ret = Add(x, y);
			printf("ret=%d\n", ret);
			break;
		case 2:
			printf("请输入2个数");
			scanf("%d %d", &x, &y);
			ret = Sub(x, y);
			printf("ret=%d\n", ret);
			break;
		case 3:
			printf("请输入2个数");
			scanf("%d %d", &x, &y);
			ret = Mul(x, y);
			printf("ret=%d\n", ret);
			break;
		case 4:
			printf("请输入2个数");
			scanf("%d %d\n", &x, &y);
			ret = Div(x, y);
			printf("ret=%d", ret);
			break;
		case 0:
			printf("退出计算器\n");
			break;
		default:
			printf("输入错误，请重新选择");
		}

	} while (input);
	return 0;
}

咱们在进行优化

#include<stdio.h>
int Add(int x, int y)
{
	return x + y;
}
int Sub(int x,int y)
{
	return x - y;
}
int Mul(int x, int y)
{
	return x * y;
}
int Div(int x, int y)
{
	return x / y;
}
void menu()
{
	printf("***************************\n");
	printf("*******1.Add   2.Sub*******\n");
	printf("*******3.Mul   4.Div*******\n");
	printf("************5.Eixt*********\n");
	printf("***************************\n");
}
void Calu(int (*pf)(int, int))
{
	int ret = 0;
	int x, y;
	printf("请输入2个数");
	scanf("%d %d", &x, &y);
	ret = pf(x, y);
	printf("ret=%d", ret);
}
int main()
{
	int x, y;
	int ret = 0;
	int input = 0;
	do
	{
		menu();
		printf("请选择>");
		scanf("%d", &input);
		switch (input) {
		case 1:
			Calu(Add);
			break;
		case 2:
			Calu(Sub);
			break;
		case 3:
			Calu(Mul);
			break;
		case 4:
			Calu(Div);
		case 0:
			printf("退出计算器\n");
			break;
		default:
			printf("输入错误，请重新选择");
		}

	} while (input);
	return 0;
}

---

2.qsort使用举例

使用qsort函数排序整型数据

#include<stdio.h>
#include<stdlib.h>
//void qsort (void* base, size_t num, size_t size,int (*compar)(const void*, const void*));
int cmp(int*pa,int *pb)
{
	return *pa - *pb;
}
void print_arr(int *arr, int sz)
{
	for (int i = 0; i < sz; i++)
		printf("%d ", arr[i]);
	printf("\n");
}
int main()
{
	int arr[] = { 9,8,6,3,2,1,10,4,7,5};
	int sz = sizeof(arr) / sizeof(arr[0]);
	qsort(arr, sz, sizeof(int), cmp);
	print_arr(arr, sz);
	return 0;
}

2.2 使用qsort排序结构数据

#include<stdio.h>
#include<stdlib.h>
struct Student {
	char name[20];
	int age;
};
int cmp_age(const void* pa, const void* pb)
{
	return ((struct Student*)pa)->age - ((struct Student*)pb)->age;
}
int main()
{
	struct Student s[3] = { {"zhangsan",18},{"lisi",31},{"wangwu",30} };
	int sz = sizeof(s) / sizeof(s[0]);
	qsort(s, sz, sizeof(s[0]), cmp_age);
	return 0;
}

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct Student {
	char name[20];
	int age;
};
int cmp_name(const void* pa, const void* pb)
{
	return strcmp(((struct Student*)pa)->name, ((struct Student*)pb)->name);
}
int main()
{
	struct Student s[3] = { {"zhangsan",18},{"lisi",31},{"wangwu",30} };
	int sz = sizeof(s) / sizeof(s[0]);
	//qsort(s, sz, sizeof(s[0]), cmp_age);
	qsort(s, sz, sizeof(s[0]), cmp_name);
	return 0;
}

---

3.qsort函数的模拟实现

void Swap(char* buf1, char* buf2,size_t width)
{
	int i = 0;
	for (i = 0; i < width; i++)
	{
		char tmp=*buf1;
		*buf1 = *buf2;
		*buf2 = tmp;
		buf1++;
		buf2++;
	}
}
void bubble_sort(void* base, size_t sz, size_t width,int(*cmp)(const void* p1, const void* p2))
{
	int i = 0;
	for (i = 0; i < sz - 1; i++)
	{
		int j = 0;
		for (j = 0; j < sz - i - 1; j++)
		{
			if (cmp((char*)base+j*width,(char*)base+(j+1)*width)>0)//前面大于后面
			{
				Swap((char*)base + j * width, (char*)base + (j + 1) * width,width);
			}
		}
	}
}
int main()
{
	int  arr[] = { 1,3,4,5,2,9,10,7,8,6};
	int sz = sizeof(arr) / sizeof(arr[0]);
	bubble_sort(arr, sz, sizeof(int), cmp);
	print_arr(arr, sz);
	return 0;
}

---

完