Javatpoint Logo
Javatpoint Logo

Algorithm of Huffman Code

Huffman (C)
1. n=|C|
2. Q ← C
3. for i=1 to n-1
4. do
5. z= allocate-Node ()
6. x=  left[z]=Extract-Min(Q)
7. y= right[z] =Extract-Min(Q)
8. f [z]=f[x]+f[y]
9. Insert (Q, z)
10. return Extract-Min (Q)

Example: Find an optimal Huffman Code for the following set of frequencies:

Solution:

Algorithm of Huffman Code

i.e.

Algorithm of Huffman Code

Again for i=2

Algorithm of Huffman Code
Algorithm of Huffman Code
Algorithm of Huffman Code

Similarly, we apply the same process we get

Algorithm of Huffman Code
Algorithm of Huffman Code

Thus, the final output is:

Algorithm of Huffman Code
Next TopicActivity or Task Scheduling Problem




Please Share

facebook twitter google plus pinterest

Learn Latest Tutorials

Computer Graphics Tutorial

C. Graphics
Automata Tutorial

Automata
Software Testing Tutorial

Testing
Numpy Tutorial

NumPy
Verbal Ability

Verbal A.
AWS Tutorial

AWS

Preparation

Aptitude

Aptitude
Logical Reasoning

Reasoning
Verbal Ability

Verbal A.
Interview Questions

Interview

B.Tech / MCA

DBMS tutorial

DBMS
Data Structures tutorial

DS
DAA tutorial

DAA
Operating System tutorial

OS
Computer Network tutorial

C. Network
Compiler Design tutorial

Compiler D.
Computer Organization and Architecture

COA
Discrete Mathematics Tutorial

D. Math.
html tutorial

Web Tech.
Cyber Security tutorial

Cyber Sec.
C Language tutorial

C
C++ tutorial

C++
Java tutorial

Java
.Net Framework tutorial

.Net
Python tutorial

Python
List of Programs

Programs
Control Systems tutorial

Control S.