void main()
{
int i,number,size;
struct num arr[11];
int a[]={10,8,9,5,7,6,4,15,7,8,9};
size=sizeof(a)/4;
for(i=0;i<size;i++)
arr[i]=inttobits(a[i]);
//arr,bit,size,beg,end
sortbyBit(arr,3,size,0,size-1);
printf("\n\nfinal sorted array is\n\n");
for(i=0;i<=size-1;i++)
{
number=binaryToint(arr[i]);
printf("\n%d\n",number);
//printf("\n%d%d%d%d\n",arr[i].bits[3],arr[i].bits[2],arr[i].bits[1],arr[i].bits[0]);
}
}
int main()
{
huffcode_t **r;
int i;
char strbit[MAXBITSPERCODE];
const char *p;
long freqs[BYTES];
memset(freqs, 0, sizeof freqs);
p = test;
while(*p != '\0') freqs[*p++]++;
r = create_huffman_codes(freqs);
for(i=0; i < BYTES; i++) {
if ( r[i] != NULL ) {
inttobits(r[i]->code, r[i]->nbits, strbit);
printf("%c (%d) %s\n", i, r[i]->code, strbit);
}
}
free_huffman_codes(r);
return 0;
}
