登录
首页 » Visual C++ » dd2

dd2

于 2014-05-21 发布 文件大小:1KB
0 212
下载积分: 1 下载次数: 87

代码说明:

  自己用c语言写的一个模块化多电平最近电平调制排序的c程序,希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)

文件列表:

dd2.c,1885,2014-05-21

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

发表评论

0 个回复

  • suanfa
    匈牙利算法以及指派问题介绍,kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)
    2011-09-10 09:42:39下载
    积分:1
  • 5-source--code-of-DS--PRO
    数据结构课上老师布置的5个小项目的源代码,分别是汽车过河,一元多项式,迷宫,日历,BFS_DFS(failed to translate)
    2011-05-18 17:01:17下载
    积分:1
  • neu_SSD
    东北大学数据结构实验指导书,2014级东北大学软件学院软件工程专业(Experimental data structure, guide books, Northeastern University, Northeastern University School of Software 2014 Software Engineering)
    2016-06-30 16:12:38下载
    积分:1
  • DataStructureTest
    数据结构的一些基本的相关的试验,如二叉树的遍历,打印,如排序算法,检索算法,动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)
    2009-01-20 13:18:22下载
    积分:1
  • hill-climbing
    改进爬山算法,用于风力发电机实现风能最大追踪,找到最佳叶尖速比,实现最大功率(modified hill-climbing algorithm for wind turbine with MPPT)
    2017-02-26 12:21:08下载
    积分:1
  • huffman
    使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
    2013-07-15 23:59:47下载
    积分:1
  • Maze
    c++用栈来实现迷宫求解(c语言数据结构)(c++ stack maze solving (c language data structure))
    2012-10-27 23:08:34下载
    积分:1
  • MyKD Tree
    KD树算法,能够实现对点云数据进行压缩,非常简单,适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)
    2015-06-24 20:10:33下载
    积分: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
  • list-and-array
    数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
    2013-10-17 11:32:30下载
    积分:1
  • 696516资源总数
  • 106579会员总数
  • 0今日下载