通用的qsort逻辑
#include<assert.h>
#include<string.h>
#include<stdio.h>
int compare(const void* x_, const void* y_)
{
return strcmp( *(char**)x_, *(char**)y_);
}
void swap(void* x_, void* y_,int size)
{
int i = 0;
for (i = 0; i < size; i++)
{
*((char*)x_ + i) ^= *((char*)y_ + i);
*((char*)y_ + i) ^= *((char*)x_ + i);
*((char*)x_ + i) ^= *((char*)y_ + i);
}
}
void mysqort(void *base, int sz, int size, int (*compare)(const void*, const void*))
{
assert(base);
int i = 0;
for (i = 0; i < sz - 1; i++)
{
int j = 0, flag = 0;
for (j = 0; j < sz - i - 1; j++)
{
if (compare((char*)base + size * j, (char*)base + size * (j + 1)) > 0)
{
swap((char*)base + size * j, (char*)base + size * (j + 1),size);
flag = 1;
}
}
if (flag == 0)
{
break;
}
}
}
int main()
{
;
char *a[] = {"absd","bsfd","acfg","aaaa9"};
int i = 0;
mysqort(a, sizeof(a) / sizeof(a[0]), sizeof(int), compare);
for (i = 0; i < sizeof(a) / sizeof(a[0]); i++)
{
printf("%s\n", a[i]);
}
return 0;
}