模拟实现qsort函数

#define  _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>

int my_cmp(const void* p1,const void* p2)
{
	return *(int*)p1 - *(int*)p2;
}


void my_swap(void* p1,void* p2,int size)
{
	int i = 0;
	for (i=0;i<size;i++)
	{
		char tmp = *((char*)p1+i);
		*((char*)p1+i) = *((char*)p2+i);
		*((char*)p2+i) = tmp;
	}
}

void bubble(void *base,int count,int size,int(*cmp)(void* ,void* ))
{
	int i = 0;
	int j = 0;
	for (i=0;i<count-1;i++)
	{
		for (j=0;j<count-i-1;j++)
		{
			if ( my_cmp((char*)base+j*size,(char*)base+(j+1)*size) >0)
			{
				my_swap((char*)base+j*size,(char*)base+(j+1)*size,size);
			}
		}
	}
}
int main()
{
	int arr[] = {2,4,6,8,0,1,3,5,7,9};
	int i = 0;
	int sz = sizeof(arr)/sizeof(arr[0]);
	bubble(arr,sz,sizeof(int),my_cmp);
	for (i=0;i<sz;i++)
	{
		printf("%d ",arr[i]);
	}
	return 0;
}