array

代码说明：

  和Huffman-Tree一样，Shannon-Fano coding也是用一棵二叉树对字符进行编码。但在实际操作中呢，Shannon-Fano却没有大用处，这是由于它与Huffman coding相比，编码效率较低的结果（或者说香农-范诺算法的编码平均码字较大）。(And Huffman-Tree, like, Shannon-Fano coding is using a binary character coding. However, in practice it, Shannon-Fano, but not much use, since it is compared with the Huffman coding, coding efficiency is the result of a lower (or Shannon- Fano coding algorithm larger average code word).)