Analysis of Huffman's algorithm:

• O(n+d·log d) time
  • n … length of the input text T
  • s … number of distinct characters in T