登录
首页 » Visual C++ » Poly

Poly

于 2010-12-24 发布 文件大小:174KB
0 191
下载积分: 1 下载次数: 1

代码说明:

  多项式相加的数据结构试验·············(Polynomial sum test data structure)

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

发表评论

0 个回复

  • BiTree
    本算法用于实现二叉树的查找和输出,使用了数据结构中的二叉树结构,精髓在于使用了函数指针。( This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.)
    2016-04-05 17:09:03下载
    积分:1
  • shizuo
    用哈夫曼编码的方式进行图像的压缩,其中定义了一个cdib的类,通过之类来对图像进行处理(image coding in haffman)
    2012-04-27 18:37:47下载
    积分:1
  • template
    说明:  ACM及各类基本算法模板,包括数据结构,计算几何,字符串,图论,数学,高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)
    2009-08-20 22:37:29下载
    积分:1
  • BinaryTree
    数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)
    2010-06-26 10:51:43下载
    积分:1
  • HuffanCoding
    读取数据,统计所得到的文件中每个字母的权值,创建哈夫曼树,哈夫曼编码。哈夫曼解码,解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组,最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计,统计每个字母出现的次数,次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据,哈夫曼树根据每个字母权值的大小来创建,每个节点,包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码,将此编码返回。 根据哈夫曼树得到的数组即为解码数组,解码数组作为解码的结果返回。 写入输出文件,将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入,将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
    2020-07-02 15:40:01下载
    积分:1
  • KD-tree
    kd-树(k维搜索树)是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
    2013-05-10 11:03:53下载
    积分:1
  • 851DataStructure2009
    江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)
    2011-09-25 11:51:05下载
    积分:1
  • InverseList
    说明:  链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
    2011-04-04 11:15:58下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • code1
    键盘任意输入一组字母或数字生成无序数组,对数组按ASCII顺序进行排序(排序要求至少用两种排序算法),再从键盘输入一个值进行二分查找,返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)
    2010-07-14 11:42:56下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载