模仿qsort的功能实现的一个通用的冒泡排序

#include <stdio.h>
#include <string.h>
struct Stu
{
	char name[20];
	int age;
};
int cmp_name(const void *e1, const void *e2)
{
	return  strcmp(((struct Stu*)e1)->name, ((struct Stu*)e2)->name);
}
int cmp_age(const void *e1, const void *e2)
{
	return ((struct Stu*)e1)->age - ((struct Stu*)e2)->age;
}
int cmp_char(const void *e1, const void *e2)
{
	return *((char *)e1) - *((char *)e2);
}
void my_swap(char *e1, char *e2, int width)
{
	int i = 0;
	for (i = 0; i < width; i++)
	{
		char tmp = *(e1+i);
		*(e1 + i) = *(e2 + i);
		*(e2 + i) = tmp;
	}
}
int cmp_int(const void *e1, const void *e2)
{
	return *(int *)e1 - *(int *)e2;
}
void my_qsort(void *arr, int sz, int width, int(*cmp)(const void *e1, const void *e2))
{
	int i = 0;
	for (i = 0; i < sz - 1; i++)
	{
		int j = 0;
		for (j = 0; j < sz - i - 1; j++)
		{
			if (cmp(((char*)arr + j*width), ((char*)arr + (j+1)*width))>0)
			{
				my_swap(((char*)arr + j*width), ((char*)arr + (j + 1)*width),width);
			}
		}
	}
}
int main()
{
	int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1 };
	char arr1[] = { 'f', 'e', 'd', 'c', 'a', 'b' };
	struct Stu s[3] = { { "zhangsan", 20 }, { "wangwu", 18 }, { "lisi", 26 } };
	int sz2 = sizeof(arr1) / sizeof(arr1[0]);
	int sz1 = sizeof(arr) / sizeof(arr[0]);
	int sz3 = sizeof(s) / sizeof(s[0]);
	my_qsort(s, sz3, sizeof(s[0]), cmp_name);
	my_qsort(s, sz3, sizeof(s[0]), cmp_age);
	my_qsort(arr, sz1, sizeof(arr[0]), cmp_int);
	my_qsort(arr1, sz2, sizeof(arr1[0]), cmp_char);
	return 0;
}