登录
首页 » Visual C++ » huffmancode

huffmancode

于 2008-01-14 发布 文件大小:1KB
0 170
下载积分: 1 下载次数: 1

代码说明:

  哈夫曼编码程序,实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Function-parameters
    C语言插入排序算法及代码 C语言中函数参数的传递有:值传递、地址传递、引用传递这三种形式。题一为值传递,题二为地址传递,题三为引用传递。(Insertion sort algorithm and C language code The parameter of function in C language transfer: transfer value, address, pass by reference to these three forms. Problem a value transfer, the transfer of Title address, three for reference. )
    2014-06-30 21:28:28下载
    积分:1
  • vbsort
    vb实现的排序算法演示vb实现的排序算法演示.冒泡、选择、折半等多种排序算法(vb sort demodemodemodemodemovb sort demodemodemodemodemo)
    2011-10-09 10:21:28下载
    积分:1
  • 1_19
    顺序查找和时间 清华大学出版社 《数据结构 c++》 (search in order)
    2011-02-05 21:56:14下载
    积分:1
  • fibonaqi
    说明:  斐波那契 式子计算,属于算法类的 用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)
    2011-04-07 09:10:16下载
    积分:1
  • example-program
    里面有50例经典算法,其中包括水仙花素,兔子的繁殖等古典问题的求解(There are 50 cases of classic algorithms, including daffodils prime, rabbit breeding classical problem solving)
    2013-02-03 11:14:12下载
    积分:1
  • xianxingbiao
    另外一个可以实现线性表的程序,简单的操作,值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)
    2007-12-07 20:20:32下载
    积分:1
  • kruscal_Primspanningtree
    最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
    2010-07-14 10:10:54下载
    积分:1
  • HuffmanTree
    用c++实现的haffman tree 小程序,仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)
    2013-03-14 16:38:15下载
    积分:1
  • Dynamic-Memory-Allocation
    这个程序是有关计算机的动态内存分配的数据结构 可以直接加载头文件与源文件即可使用其中的接口(This program is a data structure for dynamic memory allocation of the computer can directly load the header files and source files you can use one of the interfaces)
    2012-05-22 16:36:13下载
    积分:1
  • Hash-table
    哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表,使得平均查找长度不超过R,完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个,取平均查找长度的上限为2。构造哈希函数,用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。(Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.)
    2011-12-19 15:39:00下载
    积分:1
  • 696516资源总数
  • 106579会员总数
  • 0今日下载