3345=数据结构实验之二叉树六：哈夫曼编码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char s[2000];
int num[2000],queue[2000];
void so(int s[],int l,int r)
{
    if(l>=r)return;
    int i=l,j=r;
    int temp=s[l];
    while(i<j)
    {
        while(i<j&&s[j]>=temp)j--;
        s[i]=s[j];
        while(i<j&&s[i]<=temp)i++;
        s[j]=s[i];
    }
    s[i]=temp;
    so(s,l,i-1);
    so(s,i+1,r);
}
int main()
{
    while(~scanf("%s",s))
    {
        int top = 0,i;
        int len = strlen(s);
        memset(num,0,sizeof(num));
        memset(queue,0,sizeof(queue));
        for(i=0; i<len; i++)
        {
            num[s[i]]++;
        }
        for(i=0; i<500; i++)
        {
            if(num[i]!=0)
            {
                queue[top++]=num[i];
            }
        }
        so(queue,0,top-1);
        int be=0;
        int sum=0;
//----------------------------------------------------------------------
        while(be!=top)
        {
            int x = queue[be++];
            if(be!=top)
            {
                int y = queue[be++];
                queue[top++] = x+y;
                sum = sum+x+y;
                so(queue,be,top-1);
            }
        }
        printf("%d %d %.1lf\n",8*len,sum,8.0*len/sum);
    }
    return 0;
}