无敌版通用冒泡排序

#include<stdio.h>
#include<stdlib.h>
void swap(char* buf1,char* buf2,int width)
{
	int i = 0;
	for (i = 0; i < width; i++)
	{
		char tmp = *buf1;
		*buf1 = *buf2;
		*buf2 = tmp;
		buf2++;
		buf1++;
	}



}

int bubble_sort(void* base, int sz, int width, int(*cmp)(const void* e1, const void* e2))
{
	int flag = 0;//表明是否排序好
	int i = 0;
	for (i = 0; i < sz - 1; i++)
	{
		int j = 0;
		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;

}
int main()
{
	int arr[] = { 123,432,521,4,55,3,1};
	int sz = sizeof(arr) / sizeof(arr[0]);
	bubble_sort(arr, sz, sizeof(arr[0]), cmp_int);
	for (int i = 0; i < sz; i++)
	{
		printf("%d ", arr[i]);
	}
	return 0;
}