For 10 points, name this entropy encoding algorithm used for lossless data compression, used in the audio codec mp3.
This algorithm is most efficient when the probability of each input symbol is a negative power of two. Compared to other algorithms in coding theory, this algorithm is most efficient when combining truly random variables. If subtrees are kept on a priority queue by cumulative frequency, this algorithm needs to insert n+1 leaf frequencies onto the queue. It then repeatedly removes the two smallest elements from the queue, unites them into a subtree, and puts that subtree back into the queue, continuing until the queue contains the optimum tree. This technique uses fewer bits to encode more frequently occurring characters and more bits for less frequently occurring characters. For 10 points, name this entropy encoding algorithm used for lossless data compression, used in the audio codec mp3.
This algorithm is most efficient when the probability of each input symbol is a negative power of two.
{Huffman} algorithm or coding