哈夫曼编码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void sqort(int a[], int l,int r)
{
    int i, j, key;
    i = l;
    j = r;
    key  = a[l];
    if(l >= r)
        return;
    while(i < j)
    {
        while(i < j&&a[j] >= key)
           {
             j--;
           }
           a[i] = a[j];
        while(i < j&&a[i] <= key)
            {
                i++;
            }
            a[j] = a[i];
    }
    a[i] = key;
    sqort(a,l,i-1);
    sqort(a,i+1,r);
}
int main()
{
    char str[10010];
    int i, len, la, lh, top, rear, x1, x2;
    int num[1000], s[1000];
    double sum;
    while(~scanf("%s",str))
    {
         len = strlen(str);
        la = len * 8;
        top = rear = 0;
        lh = 0;
        memset(num,0,sizeof(num));
        for(i = 0;i < len;i++)
        {
            num[str[i]-'0'+48]++; //统计字符的数量
        }
        for(i = 0;i < 1000;i++)
        {
            if(num[i] != 0)
            {
                s[top++] = num[i]; //需要把统计好的数存起来
            }
        }
        sqort(s,0,top-1);//将存好的数进行快排，因为要计算哈夫曼编码
        while(top != rear)
        {
            x1 = s[rear++];
            if(top != rear)
            {
                x2 = s[rear++];

                lh += (x1+x2);
                s[top++] = x1+x2;
                sqort(s,rear,top-1);
            }
        }
        sum = 1.0*la/lh;
        printf("%d %d %.1lf\n",la,lh,sum);
    }
    return 0;
}