资源列表
Create_Polynomail
- 用于创建多项式并以符合我们习惯的方式显示。还提供了多项式相加的功能-it create a polynomail and display it in the way that satisfy our habite.additonally it provide the function to add two polynomails
FILE42
- 数据结构的三元组顺序表来实现稀疏矩阵的快速转置 C语言版 有解压的密码 请大家小心用好 压缩文件有密码 源码太简单-Data structure of the triple sequence table to achieve fast sparse matrix transpose C language version has unzip password, please make good use of everyone carefully compressed file has a pa
queueinserionanddeletion
- 采用数据结构算法，实现在队列中的插入和删除-The use of data structure algorithms, to achieve in the queue insertion and deletion
tree
- 二叉树的遍历问题中关于使用二叉树进行表达式求值-Binary Tree Traversal issues on the use of the expression tree for evaluation
SqQueue
- 顺序队列模板类，支持多线程。仅一个头文件定义。-Queue template class in order to support multi-threading.
Joseqh
- 约瑟夫环的问题解决，巩固初学者的编程基础-Joseph ring problem solving, consolidation of basic programming for beginners
6
- 1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define the hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-ha
Floyed
- 根据Floyed算法写出程序计算对顶点间的最短路径和最短距离。-According to the Floyed algorithm to write program to calculate the shortest path and shortest distance between vertices.
rmq
- 经典RMQ问题，用来实现区间最大值和最小值的统计，预处理时间nlogn,查询时间O(1)-Classic the RMQ question, is used to achieve the interval maximum value and the minimum statistics, pretreatment time nlogn, query time O (1)
随机数赋值给数组
- 用C语言编写一段0-9的随机整数用循环，每次产生1个0-9的随机数赋值给一个数组-C language a period of 0-9 random integer cycle, each generation of a 0-9 random number assigned to an array
bpsk1
- 本程序是自己写的，在瑞丽衰落信号下的BPSK仿真，已经经过试验成功-This program is written in their own, in Ruili fading BPSK simulation signal, has been successfully tested
Josephus
- 一个经典的约瑟夫环游戏算法，每个人抽到的数都不同-A classic game Josephus algorithm, the number of each person are different pumped