C 语言泛型编程--quickSort实现

#ifndef _GENERICQUICKSORT_H_
#define _GENERICQUICKSORT_H_
void generic_swap(void * pa, void * pb, int typeSize);
void generic_qsort(void * pa, int elemSize, int typeSize,
                            int (*cmp)(void *,void *));
#endif

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "generic_quick_sort.h"

static void quick_sort();
void generic_swap(void * pa, void * pb, int typeSize)
{
    void * ptmp = malloc(typeSize);
    memcpy(ptmp,pa,typeSize);
    memcpy(pa,pb,typeSize);
    memcpy(pb,ptmp,typeSize);
    free(ptmp);
}

void generic_qsort(void *pa, int elemSize, int typeSize,
                            int (*cmp)(void *, void *))
{
    char *paa = (char*)pa;
    quick_sort(paa,0,elemSize-1,typeSize,cmp);
}

static void quick_sort(char *paa, int beg, int end, int typeSize,
                            int (*cmp)(void *, void *))
{    
    if(beg >= end)
        return;
    int mid = (beg+end)/2;
    g_swap(paa + end * typeSize, paa + mid * typeSize, typeSize);
    char *border = paa + end * typeSize;
    int i = beg;
    int j = beg;
    for(; j < end; j++)
    {
        if(cmp(paa+j*typeSize, border) < 0){
            g_swap(paa+j*typeSize, paa+i*typeSize,typeSize);
            i++;
        }
    }
    g_swap(paa+j*typeSize, paa+i*typeSize,typeSize);
    quick_sort(paa,beg,i-1,typeSize,cmp);
    quick_sort(paa,i+1,end,typeSize,cmp);
}

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "generic_quick_sort.h"
#define PRINT_STUDENT(stu)    
    printf("name = %-10s, score = %-.2f
",stu.name, stu.score)

enum {LEN=10};
typedef struct student{
    char name[LEN];
    double score;
}student;

int cmp_stu(void *a, void *b);

int main()
{    
    student stu[5] = {
        {"Linda", 76.14},
        {"Angel",84.41},
        {"Jim", 98.25},
        {"Trump", 34.98},
        {"Walle", 100}
    };
    generic_qsort(&stu,5,sizeof(student),cmp_stu);
    for(int i = 0; i < 5; i++){
        PRINT_STUDENT(stu[i]);
    }
    return 0;
}

int cmp_stu(void *a, void *b)
{
    student * pa = (student *)a;
    student * pb = (student *)b;
    if(pa->score < pb->score)
        return -1;
    else if(pa->score > pb->score)
        return 1;
    else return 0;
}