快速排序

#include <stdlib.h>

#define MAXN 100
int num[MAXN] = {4,9,7,3,2,0,1,8,6,5};

void (int *a, int n)
{
    for(int i = 0; i < n; ++i)
        printf("%d ",a[i]);
    puts("");
}

void swap(int *a, int *b)
{
    int temp = *a;
    *a = *b;
    *b = temp;
}


void quickSortOne(int *a, int l, int r)
{
    if(l > r) return ;
    int i = l, j = r;
    int axi = a[l];
    while(i != j)
    {
        while(i < j && a[j] >= axi)
            --j;
        while(i < j && a[i] <= axi)
            ++i;
        if(i < j)
            swap(&a[i], &a[j]);
    }
    a[l] = a[i];
    a[i] = axi;
    quickSortOne(a, l, i-1);
    quickSortOne(a, i+1, r);
}

//挖坑法
void quickSortTwo(int *a, int l, int r)
{
    if(l > r) return ;
    int i = l, j = r;
    int axi = a[l];
    while(i != j)
    {
        while(i < j && a[j] >= axi)
            --j;
        a[i] = a[j];
        while(i < j && a[i] < axi)
            ++i;
        a[j] = a[i];
    }
    a[i] = axi;
    quickSortTwo(a, l, i-1);
    quickSortTwo(a, i+1, r);
}

//采用了挖坑法实现一个统一的排序
void mySort(int *a, int l, int r, int (*comp)(void*, void*))
{
    if(l > r) return;
    int i = l, j = r;
    int axi = a[l];
    while(i != j)
    {
        while(i < j && !comp(&a[j], &axi))
            --j;
        a[i] = a[j];
        while(i < j && comp(&a[i], &axi))
            ++i;
        a[j] = a[i];
    }
    a[i] = axi;
    mySort(a, l, i-1, comp);
    mySort(a, i+1, r, comp);
}

int cmp(int *a , int *b)
{
    return *a < *b;
}

int main()
{
    mySort(num, 0, 9, cmp);
    print(num,10);
    return 0;
}