选择查找算法

#include <stdio.h>
#include <stdlib.h>
#define swap(a,b) (temp=a,a=b,b=temp)
int temp;
void merge(int a[],int p,int q,int r)
{
    int *pa;
    pa=malloc((r-p+2)*sizeof(int));
    int i,j,k;
    i=p;
    j=q+1;
    k=0;
    while (i<=q&&j<=r)
    {
        if (a[i]<a[j])pa[k++]=a[i++];
        else pa[k++]=a[j++];
    }
    if (i>q)while(j<=r)pa[k++]=a[j++];
    else while(i<=q)pa[k++]=a[i++];
    k=0;
    for (i=p;i<=r;i++)a[i]=pa[k++];
    free(pa);
}
void merge_sort(int a[],int n)
{
    int m,s,t=1;
    while (t<n)
    {
        s=t;t=2*s;m=0;
        while(m+t<n)
        {
            merge(a,m,m+s-1,m+t-1);
            m=m+t;
        }
        if(m+s<n)
            merge(a,m,m+s-1,n-1);
    }
}
void mid(int a[],int i,int p[])
{
    int k=5*i;
    int m,n;
    for(m=k;m<=k+5;m++)
        for(n=k;n<k+5-m;n++)
            if(a[m]>a[m+1])
                swap(a[m],a[m+1]);
    p[i]=a[k+2];
    /*if(a[k]>a[k+2])
        swap(a[k],a[k+2]);
    if(a[k+1]>a[k+3])
        swap(a[k+1],a[k+3]);
    if(a[k+2],a[k+3])
        swap(a[k+2],a[k+3]);
    if(a[k+1],a[k+2])
        swap(a[k+1],a[k+2]);//为前四个元素排序
    if(a[k+4]>a[k+2])
         p[i]=a[k+2];
    else if(a[k+4]>a[k+1])
        p[i]=a[k+4];
    else
        p[i]=a[k+1];*/
         
}
int Select(int a[],int n,int k)
{
    int i,j,s,t;
    int m,*p,*q,*r;
    if(n<38)
    {
        merge_sort(a,n);
        return a[k-1];
    }
    p=malloc((3*n/4)*sizeof(int));
    q=malloc((3*n/4)*sizeof(int));
    r=malloc((3*n/4)*sizeof(int));
    for(i=0;i<n/5;i++)
        mid(a,i,p);
    m=Select(p,i,i/2+1);
    i=j=s=0;
    for(t=0;t<n;t++)
        if(a[t]<m)
            p[i++]=a[t];
    else if(a[t]==m)
        q[j++]=a[t];
    else
        r[s++]=a[t];
    if(i>k)
        return Select(p,i,k);
    else if (i+j>=k)
        return m;
    else
        return Select(r,s,k-i-j);
}
int main(int argc, const char * argv[]) {
    int m,a[29]={8,31,60,33,17,4,51,57,49,35,11,43,37,3,13,52,6,19,25,32,54,16,5,41,7,23,22,46,29};
    m=Select(a,29,18);
    printf("%d\n",m);
    return 0;
}