C语言中的通用编程

来源：互联网发布：鲁班钢筋预算软件编辑：程序博客网时间：2024/05/01 12:22

一个简单的快排，随机化，尾递归的好像都没做，很久以前写的了，最近学Python的functional program又翻了出来，

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<assert.h>void swap(void *vp1, void *vp2,int size){    char *cp = (char*)malloc(size);    memcpy(cp,vp1,size);    memcpy(vp1,vp2,size);    memcpy(vp2,cp,size); }int cmp(void *vp1, void *vp2){    return *(int*)vp1 - *(int*)vp2;}void qsort(void *base,int n,int elemsize,int (*cmp)(void*, void*)){    int left = 0,right = n-1;    void *pivot = malloc(elemsize);    assert(pivot != NULL);    memcpy(pivot,base,elemsize);    while(left<right)    {        while(left<right && cmp((char*)base+elemsize*right,pivot)>0)  right--;        while(left<right && cmp((char*)base+elemsize*left,pivot)<=0)  left++;        swap((char*)base+elemsize*left,(char*)base+elemsize*right,elemsize);    }    free(pivot);    swap(base,(char*)base+elemsize*right,elemsize);    if(0<left-1)    qsort(base,left,elemsize,cmp);    if(left+1<n-1)  qsort((char*)base+elemsize*(left+1),n-left-1,elemsize,cmp);    return ;}int main(){    int a[10] = {16,4,10,14,7,9,3,2,8,1};    qsort(a,10,sizeof(int),cmp);    for(int i=0;i<10;i++)    {        printf("%d ",a[i]);    }    return 0;}

0 0