c 语言，标准库 qsort 重写

在stlib.h头文件里面有qsort函数，只是感觉写得不够简洁（也许有其他原因才故意这样写的），所以重写了一下。

#include <stdio.h>
#include <string.h>

#define MAX_BUFFER 256
#define min(a, b) (a < b ? a : b)

typedef int _Campare(const void*, const void *);

int cmp(const void *a, const void *b)
void swap(void *a, const void *b, size_t size)
void qsort(void *base, size_t n, size_t size, _Campare *cmp);

int main()
{	/* test sorting */
	int a[] = {3,7,5,8,9};
	size_t n = sizeof(a)/sizeof(int);
	qsort(a, n, sizeof(int), cmp);
	int i;
	for (i = 0; i < n; i++)
		printf("%d\t", a[i]);
	
	return 0;
}

int cmp(const void *a, const void *b)
{	/* compare function for sort */
	return *(int *)a-*(int*)b;
}

void swap(void *a, const void *b, size_t size)
{	/* swap the memory between a and b */
	char buf[MAX_BUFFER];
	size_t m = 0;
	char *qi = (char *)a;
	char *qj = (char *)b;
	for (; size > 0; size -= m){ /* swap as many as possible */
		m = min(sizeof (buf), size);
		memcpy(buf, qi, m);
		memcpy(qi, qj, m);
		memcpy(qj, buf, m);
		qi += m;
		qj += m;
	}
}

void qsort(void *base, size_t n, size_t size, _Campare *cmp)
{   /* quick sort function */
    if (n <= 1)
        return;
    char *qi = (char*)base;
    int i = 0;
    char *qj = qi + (n-1)*size;
    int j = n-1;
    char *qp = qj;
    
    while (i < j){ /* seperate array into two part */
        while (i < j && cmp(qi, qp) <= 0)
            i++, qi += size;
        while (i < j && cmp(qp, qj) <= 0)
            j--, qj -= size;
        swap(qi, qj, size);
    }
    swap(qi, qp, size);        /* put the left item into mid */
    qsort(base, i, size, cmp);    /* sort the right items */
    qsort(qi+size, n-i-1, size, cmp); /* sort the left items */
}