搜索资源列表
yueguang
- 分而治之方法还可以用于实现另一种完全不同的排序方法，这种排序法称为快速排序（quick sort）。在这种方法中， n 个元素被分成三段（组）：左段l e f t，右段r i g h t和中段m i d d l e。中段仅包含一个元素。左段中各元素都小于等于中段元素，右段中各元素都大于等于中段元素。因此l e f t和r i g h t中的元素可以独立排序，并且不必对l e f t和r i g h t的排序结果进行合并。m i d d l e中的元素被称为支点( p i v o t )。图1 4
hafumashuhezifuchuanzuixiaoshengchengshu
- 是一些串操作、赫夫曼树、我的最小生成树的源码希望能帮助大家希望站长能够支持我，谢谢了！-some string operation, Hefuman tree. My minimum spanning tree source of hope to help everyone hopes will support my head, thank you!
HuffmanTree.c
- 赫夫曼编码,它具体点说明了编码的步骤,让初学者一看就明了.-Hefuman coding, it shows a specific encoding step for a beginner can understand it.
hfafumanbianmawenti
- 对任意输入的一段英文，为每个字符编制其相应的赫夫曼编码；并利用该编码为任意输入的0、1序列进行解码． -the indiscriminate importation of the English section to the preparation of each character corresponding Hefuman coding; The coding and use of indiscriminate importation of 0, a sequence decoder.
fivechessl
- 五子棋！设计是利用赫夫曼构造法建立赫夫曼树，再利用赫夫曼树求编码-331! Hefuman design is the use of structural method Hefuman tree, the tree used for coding Hefuman
hefumanshu
- 赫夫曼树的c语言实现。 建赫夫曼树…… 从叶子到根逆向求每个字符的赫夫曼编码-Hefuman tree c language. Hefuman built from tree leaves ... to root for each character reverse the Hefuman coding
huffman
- 课程设计： 任务 ：建立最优二叉树函数。 要求：可以建立函数输入二叉树，并输出其赫夫曼树。 -Course Design : Mission : To establish the optimal binary tree function. Requirements : function can be established Binary Tree imported and exported its Hefuman tree.
humanshu
- 这是一个数据结构的遍历赫夫曼树的程序,是有C编程的-This is a data structure of the tree traversal Hefuman procedures, C Programming
hefuman
- 赫夫曼树：试构造一棵有n个叶子结点的二叉树，每个叶子节点带权为wi，则期中带权路径wpl的最小的二叉树-Huffman Tree: test construct an n-leaf nodes are the binary tree, each leaf node with a right to wi, then the period of the right path with the smallest binary tree wpl
hefuman
- 赫夫曼编码译码，还有画图，是很好的一个数据结构程序-it s vervy good
hefuman
- 哈夫曼编码，对哈夫曼编码用java语言进行了实现-Huffman coding, Huffman coding on the realization of using java language
hefuman
- 1、使用链表结构。 2、使用《数据结构》（严蔚敏，C语言版）中给出的算法； 3、增加预先排序的功能的算法 -1, the use of linked list structures. 2, the use of "data structure " (Yan Wei-min, C-language version) gives the algorithm 3, increasing the function of pre-sorting algorithm
hefuman.cpp.cpp
- 赫夫曼编码和译码，当时大一的时候上数据结构时写的-Huffman encoding and decoding, when the then freshman writing on the data structures
26zimu-hefuman
- 统计文章中26个字母出现的频率并以此为权值构建哈弗曼树，输出各个字母的哈弗曼编码-Statistics article 26 the frequency of letters and as a weight build Hafu Man tree, the output encoding of each letter Hafu Man
hefuman
- 赫夫曼树的算法 希望对大家有用 数据结构必会程序-Huffman tree algorithm we hope will be useful to program data structures
hefuman
- 建议赫夫曼树，及对应的赫夫曼编码，译码，翻译，加密。-Huffman tree, and the corresponding Huffman encoding, decoding, translation, encryption is recommended.
hefuman
- 赫夫曼树的建立 c实现文档 有源代码 还有设计流程-Huffman tree establishment c Document
hefuman
- 数据结构，哈夫曼树问题。这是大一的数据结构作业，在V6.0下运行流畅无错误-Data structure, Huffman tree problem. This is the first year the data structure operations run smoothly without errors in V6.0
hefuman
- 此程序用C语言用哈夫曼编码法实现了对英文的压缩与解压缩，是C语言编程一个比较经典的例子-this program in C language with Huffman coding method to achieve the right English compression and decompression, the C programming language is a classic example
hefuman
- 赫夫曼树：试构造一棵有n个叶子结点的二叉树，每个叶子节点带权为wi，则期中带权路径wpl的最小的二叉树-Huffman Tree: test construct an n-leaf nodes are the binary tree, each leaf node with a right to wi, then the period of the right path with the smallest binary tree wpl