登录
首页 » Visual C++ » huffman

huffman

于 2010-05-24 发布 文件大小:2KB
0 139
下载积分: 1 下载次数: 3

代码说明:

  数据结构(严蔚敏版)中哈夫曼树的操作程序源代码(Of data structure (Yan Wei Min version) operating procedures in the source code Huffman tree)

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

发表评论


0 个回复

  • Is_BST
    This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
    2012-02-02 05:45:59下载
    积分:1
  • LongestIncreasingSequence
    找出数组A中最长的递增序列的长度,使用动态规划算法,复杂度为O(N*N)。(Find the longest increasing sequence)
    2011-09-05 17:36:27下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • fiterVC051002116
    用VC++编写中值滤波的算法,具有图形界面(The algorithm of Filter ,which use VC++)
    2009-09-09 21:40:43下载
    积分:1
  • 005
    c++ data struct stack
    2012-03-01 14:24:42下载
    积分:1
  • qiongju
    八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
    2013-08-14 22:21:28下载
    积分:1
  • JGMFC
    一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )
    2010-03-11 16:13:32下载
    积分:1
  • 1_19
    顺序查找和时间 清华大学出版社 《数据结构 c++》 (search in order)
    2011-02-05 21:56:14下载
    积分:1
  • C++
    说明:  标准答案习题1 1.1 简述C++语言程序的结构特点。 答: (1)C++程序由一个或多个函数组成,其中至少有一个主函数main(),程序从主函数开始执行,由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
    2008-11-25 16:16:27下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • 696518资源总数
  • 104932会员总数
  • 12今日下载