Huffman Coding Algorithm with Example | Greedy Method (urdu/hindi)

Huffman coding is greedy approach. In this lecture basic working of Huffman coding algorithm with example has been explained. Worst case time complexity of Huffman coding algorithm has also been explained. It is data compression method. It used for lossless data compression. It assigns codes to characters such that the length of the code depends on the relative frequency or weight of the corresponding character. Character with higher frequency will have shorter code and character with lower frequency will have longer code. We also have another technique of coding called ASCII (American Standard Code for Information Interchange) coding. We made comparison with help of example that why Huffman coding is better than ASCII coding. There are total 128 characters in standard ASCII coding. We can represent them from 0-127. If we have 128 characters, it means we need minimum 7 bits to represent single character. huffman coding time complexity huffman coding technique huffman coding tree algorithm huffman coding technique with example huffman coding text compression huffman coding tutorial huffman coding tree example #AZComputing #HuffmanCoding #HuffmanComplexity