函数指针实现冒泡排序

// 冒泡排序

void Swap(char* buf1, char* buf2, int width) {
	int i = 0;
	for (i < 0;i < width;i++) {
		char tmp = *buf1;
		*buf1 = *buf2;
		*buf2 = tmp;
		buf1++;
		buf2++;
	}
}
void button_sort(void* base, int sz, int width, int(*cmp)(const void* e1, const void* e2)) {
	int i = 0;
	for (i = 0;i - 1 < sz;i++) {
		int j = 0;
		int flag = 1;
		for (j = 0;j < sz - 1 - i;j++) {
			if (cmp((char*)base + j * width, (char*)base + (j + 1) * width)>0) {
				Swap((char*)base + j * width, (char*)base + (j + 1) * width, width);
				flag = 0;
			}
		}
		if (flag == 1) {
			break;
		}
	}
}

int cmp_int(const void* e1, const void* e2) {
	return (*(int*)e1 - *(int*)e2);
}

void test1() {
	int arr[] = { 2,5,3,6,8,9,7,1,0,4 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	qsort(arr, sz, sizeof(arr[0]), cmp_int);
	int i = 0;
	for (i = 0;i < sz;i++) {
		printf("%d ", arr[i]);
	}
}
void test3() {
	int arr[] = { 2,5,3,6,8,9,7,1,0,4 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	button_sort(arr, sz, sizeof(arr[0]), cmp_int);
	int i = 0;
	for (i = 0;i < sz;i++) {
		printf("%d ", arr[i]);
	}
}

struct Stu {
	char name[20];
	int age;
};
int cmp_stu_by_name(const void* e1, const void* e2) {
	return strcmp(((struct Stu*)e1)->name, ((struct Stu*)e2)->name);
}
int cmp_stu_by_age(const void* e1, const void* e2) {
	return ((struct Stu*)e1)->age-((struct Stu*)e2)->age;
}
void test2() {
	struct Stu s[] = { {"zhangsan",15},{"lisi",30},{"wangwu",25} };
	int sz = sizeof(s) / sizeof(s[0]);
	qsort(s, sz, sizeof(s[0]), cmp_stu_by_age);
}

void test4() {
	struct Stu s[] = { {"zhangsan",15},{"lisi",30},{"wangwu",25} };
	int sz = sizeof(s) / sizeof(s[0]);
	button_sort(s, sz, sizeof(s[0]), cmp_stu_by_age);
}
int main() {
	//test1();
	//test2();
	//test3();
	test4();
	return 0;
}