Hello Everyone, I am preparing myself to get a job in IT industry. My interview has been scheduled next week on skype. I want to know why we use Huffman’s algorithm? In my last interview, I have faced this question. According to this post of programming interview questions for extending binary trees that have minimum weighted path length from given weights, we use Huffman’s algorithm. It uses a table containing the total number of times for each data element, It gave less information. Can anyone know depth information about Huffman’s algorithm?
Did you look at wikipedia?