资源列表
QR
- 对满秩矩阵进行QR分解实现过程，-Full rank matrix of the QR decomposition of the implementation process
Queue
- 队列的相关操作（比如：队列初始化，队列入队，队列出队等等）-Queue-related operations (such as: the queue is initialized, the team included in the team, team lists team, etc.)
code
- 计算矩形面积 C++语言 ＶＣ２００８ 源代码-Rectangular area of C++ language source code VC2008
wutoujiedian
- 无头结点链表，数据结构实验一，无头结点链表，数据结构实验一。-Without a head node list, a test data structure, without a head node list, the data structure first experiment.
bianchen
- 输入一个字符串，内有数字和非数字字符，如：gs 423cd156 7896>df12345，将其中连续的数字作为一个整数，依次存放到一数组a中，例如：423放在a[0],125放在a[1]，…。统计共有多少个整数，并输出这些数-Enter a string containing numbers and non-numeric characters, such as: gs 423cd156 7896> df12345, will be one of a number of conse
Floyd
- 最短路径的常见算法，能够算出图中所有节点之间的最短路径（时间复杂度为o(n^3)）-Common shortest path algorithm
kruskal
- 图论中用于搜索最小生成树和最短路径的Kruskal算法-Graph theory to search for the minimum spanning tree and shortest path algorithm of Kruskal
KMP
- KMP 改进的字符串匹配算法,由D.E.Knuth与V.R.Pratt和J.H.Morris同时发现，因此人们称它为克努特——莫里斯——普拉特操作（简称KMP算法）。KMP算法的关键是根据给定的模式串W1,m,定义一个next函数。next函数包含了模式串本身局部匹配的信息。-Improved KMP string matching algorithm, by DEKnuth with VRPratt and JHMorris also found, so people call it Knut
pqtree
- point quad tree impementation in C by Rajeev Kumar
3-6-Yacht-rental-issues
- 3-6 Yacht rental issues 算法设计与分析 课后答案 算法实现题3-6-3-6 Yacht rental issues
Cpp1
- 根输入字符串创建二叉树，输出二叉树的先根遍历和后根遍历-Root input string to create binary output binary tree traversal and after the first root root traversal
PREORDER
- 二叉树的前序遍历非递归算法，适用于数据结构。-Preorder traversal non-recursive algorithms. For data structures.