qsort的模拟实现(使用回调函数)
#include <stdio.h>
int int_cmp(const void *p1,const void *p2)
{
if (*(char *)p1 < *(char *)p2)
return -1;
else if (*(char *)p1 > *(char *)p2)
return 1;
else
return 0;
}
void swap(void *x, void *y,int sz)
{
char *p = (char*)x;
char *q = (char*)y;
while (sz--)
{
*p ^= *q;
*q ^= *p;
*p ^= *q;
p++;
q++;
}
}
void bubble(void *base, int count, int sz, int (*int_cmp)( const void *, const void *))
{
int i = 0;
int j = 0;
int flag = 0;
for (i = 0; i < count - 1; i++)
{
for (j = 0; i < count - 1 - i; j++)
{
if (int_cmp((char *)base + j*sz, (char *)base + (j + 1)*sz) < 0)
{
swap((char *)base + j*sz, (char *)base + (j + 1)*sz, sz);
flag = 1;
}
}
if (flag == 0)
break;
}
}
int main()
{
int arr[] = { 1, 58, 4, 2, 6, 0 };
bubble(arr, sizeof(arr) / sizeof(arr[0]),sizeof(int), int_cmp);
int i = 0;
for (i = 0; i < sizeof(arr) / sizeof(arr[0]); i++);
{
printf("%5d", arr[i]);
}
system("pause");
return 0;
}