桶排序算法秒杀海量数据排序！

#include<stdio.h>

#include<stdlib.h>
int cmp(const void *a,const void *b){
    return *(double *)a>*(double *)b?1:-1;
    //int型数组返回类型为
    //return *(int *)a-*(int *)b; 
}
void Input(double *a,int n){
    int i;
    for(i=0;i<n;i++)
    {
        scanf("%lf",&a[i]);
    }
}
void Tongpai(double *a,int *c,int m,int n,double **b){
    int i=0,j;
    for(i=0;i<m;i++)
    {
        double p=0.0,q=5.0;
        for(j=0;j<n;j++)
        if(a[j]>p+i*5.0&&a[j]<=q+i*5.0)c[i]++;
        b[i]=(double*)malloc(c[i]*sizeof(double)); 
        memset(b[i],0,c[i]*sizeof(double)); 
    }
    int *s=(int*)malloc(n*sizeof(int));
    memset(s,0,n*sizeof(int));
    for(i=0;i<m;i++)
    {
        double p=0.0,q=5.0;
        for(j=0;j<n;j++)
        if(a[j]>p+i*5.0&&a[j]<=q+i*5.0)b[i][s[i]++]=a[j];
    } 
    for(i=0;i<m;i++)
    {
        qsort(b[i],c[i],sizeof(double),cmp);
        for(j=0;j<c[i];j++)
        printf("%.2f ",b[i][j]);
    }
}       
int main()
{
    int n,*c;
    int m;
    double *a,**b;
    scanf("%d",&n);
    m=n/5+1;
    a=(double *)malloc(n*sizeof(double));
    c=(int *)malloc(m*sizeof(int)); //c数组标记每一个桶中元素的个数 
    memset(c,0,m*sizeof(int));
    b=(double **)malloc(m*sizeof(double*));
    Input(a,n);
    Tongpai(a,c,m,n,b);
    system("pause");
    return 0;
}