Huffman Coding

[poojithamiryala]

Description of the problem

Given a set of symbols along with their frequencies, we will find a variable-length binary code that can be assigned to each and every symbol. The main objective of this algorithm is to usually transmit information using the fewest number of bits in such a way that every encoding is unambiguous.

Expectations: Time Complexity:O(nlogn)

Methods:

1. buildHuffmanTree(symbolsWithFrequencies)
2. generateHuffmanCodes(rootOfHuffmanTree)

Example of the problem

References/Other comments

https://en.wikipedia.org/wiki/Huffman_coding

[czgdp1807]

Not an urgent need.

[shivangdubey]

Input: String X Initialize priority queue: Q c: character in string X Algorithm:

• for c in X; creating a single node binary tree T storing c

• Insert T into Q with frequency of c

1. while len(Q) > 1; (f1, T1) = Q.remove_min() (f2, T2) = Q.remove_min() Creating subtree T1(left) and T2(right) in T and inserting T into Q with key f1 + f2. (f, T) = Q.remove_min() return tree T

@czgdp1807 If this looks good, should I implement and make a PR?

[czgdp1807]

Can you define a more concrete API, like how would I call a function to obtain the huffman encoding?

P.S. - This is not an urgent need, so may not receive much attention.

[Riope]

I am interested to work on this issue.

[RhuthuHegde]

Can I work on this issue?

[Smit-create]

Can I work on this issue?

Feel free to work on it. Please provide the implementation/API plan below in the comments

[skywalker2207]

can i work on it ?