Hi,
I tried solving the above problem and I got the wrong answer for test case 21. My guess is the above problem is huffman encoding, where we can directly leave out the numbers with 0 frequencies.
Is there any solution better than huffman encoding to the above problem?
Will normal constant bit length encoding , can perform better than huffman encoding, if so under what cases?
regards
Arunachalam
--
===================================
want to know more about me
http"//ww.livejournal.com/users/arunachalam
--
===================================
want to know more about me
http"//ww.livejournal.com/users/arunachalam
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
