资源列表
RGKT1-1
- c语言。定步长求解龙哥库塔的方程。可以用n来表示方程组得个数。此方法单精度。-c language. Fixed step for Mangge Kuta equation. N can be used to express equations in number. Single precision of this method.
zju1002
- zju 1002 Fire Net 代码 -zju 1002 Net Fire Code
4
- 数据结构回文判别 运用栈与队列的c语言源程序代码-Data structure to use the stack and queue, palindrome determine c-language source code
MENU
- (estructura de datos) programa en C++ para ejemplificar un menu
fenjiedanlianbiao
- 此程序的作用是按字母、数字、其它字符分解单链表分解单链表-The role of this procedure is based on letters, numbers, other characters Decomposition single chain decomposition of a single linked list
multipliy
- 多项式相加的程序，程序可以任意输入多项式的结构，自动可以计算出多项式相加减的结果-Polynomial additive process, the program structure can be arbitrary input polynomial, the polynomial can be calculated automatically result of addition and subtraction
mergelink
- 这是一个实现有序链表合并的小程序。主要是为了掌握数据结构与算法。-This is a linked list to achieve an orderly combination of small programs. Mainly in order to grasp the data structures and algorithms.
huffmancode
- 一个哈夫曼算法.具体题目如下: 题目要求：1）建立一正文文件(本程序中建立的文件名文test.txt)，向其中输入字符（本程序中可输入任意ASCII值） 2）通过哈夫曼算法求出文件中字符的相应编码 3）建立一与正文文件(test.txt)对应的编码文件（本程序中为bainma.txt）--a Huffman algorithm. Specific topics are as follows : Subject : 1) the establishment of a text document (
N-binary-tree-to-traverse
- 本程序用递归法遍历N叉树。可进行深度和广度遍历。 注： 按“/”键结束输入 如 2 1 3 / 6 / 9 / / / / 输入可得 深度遍历为21369，广度遍历为21369 最打节点个数为100个，且节点类型为字符型-This program using a recursive method to traverse N binary tree. For depth and the breadth traverse.
baobianquzao
- 包边去噪 可以对数据进行噪声消除 提高数据质量-Hemming denoising the data noise cancellation to improve data quality
uniquely-decodable
- 判断是否唯一可译。输入：任意一个码字集合 。码字个数和每个具体的码字在运行时从键盘输入；输出：判决（是唯一可译码/不是唯一可译码）。 -Determine whether uniquely decodable. Input: an arbitrary set of code words. The number of codewords and each codeword at run time from the keyboard input Output: judgment (only d
lichthi
- Xp lch thi (LICHTHI)