登录
首页 » Visual C++ » huffman

huffman

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

代码说明:

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

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

发表评论

0 个回复

  • Haffman
    将一组数组转换为哈夫曼编码,使用数据结构中的二叉树功能实现(Convert an array to Haffman code)
    2016-01-30 14:56:20下载
    积分:1
  • houzixuandaiwang
    猴子选大王是个重要问题猴子选大王是个重要问题猴子选大王是个重要问题(houzixuandawang)
    2009-05-05 17:00:13下载
    积分:1
  • Sort
    排序程序,包含快速排序、归并排序、谢尔排序、插入排序。输出了比较次数和移动次数。(It is a sort program, including quick sort, merge sort, shell sort and insert sort.It outputs the compare times and movement times.)
    2009-05-24 18:53:10下载
    积分:1
  • Work3.5
    上海交通大学数据结构课程的课后作业系列3.5:仅供参考,最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
    2013-12-27 21:00:03下载
    积分:1
  • PX
    说明:  一个用VS2008编写的冒泡排序算法演示程序,数组都是随机生成的。(Bubble Sort)
    2014-06-18 20:06:13下载
    积分:1
  • Strassen-code
    思塞恩算法 常用算法之一 算法导论提及(strassen algorithm which can run correctly)
    2014-11-28 14:33:16下载
    积分:1
  • migongproduce
    迷宫生成器,可以根据需要自己建立各类型的迷宫,而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)
    2012-02-10 15:17:36下载
    积分:1
  • heapSort.cpp.tar
    这是一个堆排序的算法源程序,算法被单独写成一个函数,希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
    2013-12-12 14:52:48下载
    积分:1
  • fiterVC051002116
    用VC++编写中值滤波的算法,具有图形界面(The algorithm of Filter ,which use VC++)
    2009-09-09 21:40:43下载
    积分:1
  • heapsort
    说明:  从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
    2008-11-11 22:53:42下载
    积分:1
  • 696516资源总数
  • 106579会员总数
  • 0今日下载