资源列表
KMP
- 字符串模式匹配的kmp算法，虽然效率很差，但它是跳跃算法的开山之作，故倍受推崇-Kmp string pattern matching algorithms, although the efficiency is poor, but it is the pioneer of the jump for algorithms, it is highly respected
c_3
- 第七讲_文件 ppt 8 第八讲_数据结构基础 ppt 9 第九讲_算法 ppt 10 第十讲_调试与测试 -SEVEN file ppt 8 _ _ eighth data about the structural basis ppt 9 _ IX speak about algorithms ppt 10 _ debugging and testing of the tenth
logic
- 实现命题公式的判定并输出主析取范式、主合取范式，包括括号匹配，MFC实现，界面友好-Realize the proposition formula judgments and output main disjunctive normal form, principal and take paradigm, including parentheses matching, MFC realization, friendly interface!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
FDEI
- 1993-1996年美国ACM解析 包含了93-96年美国程序设计大赛的题目及程序结果错误分析以及应注意的问题()
Searching-and-Sorting
- 实现各种排序算法，并对其时间复杂度等性能进行分析-To achieve a variety of sorting algorithms, and its time complexity performance analysis
data-structure-PPT
- 数据结构ppt课件，清华大学版。总共9章，分9个ppt-Ppt data structures courseware, Tsinghua University, ed. Chapter 9 in total, divided 9 ppt
TPS
- TPS算法，做人脸校准的，同一个人脸的不同的照片做匹配，脸型匹配-Algorithms for TPS, face the calibration, the same face different photos do match, face shape matching
Work
- 算法-分支限界法-任务分配问题 数组的话可以自己修改-algorithms-branch and bound method- work assignment problem
exp6
- 对一段文本构造哈夫曼树，对所有字符根据其权值编码。对每个结点的左分支编码为0，右分支编码为1。(Constructs a Huffman tree for a text, encodes all characters according to their weights. The left branch of each node is encoded at 0 and the right branch is encoded at 1.)
0427-0424-0412
- 算法与数据结构课程设计试卷 1. 查找北京到上海使用时间最少的路线-Algorithms and Data Structures Course Design Paper 1. Find Beijing to Shanghai route with the least time
shortest route
- 运用数据网络，实现最短路径的寻找，供大家学习(The use of data networks, to achieve the shortest path to find, for everyone to learn)
22
- 1、已知带头结点的动态单链表L中的结点是按整数值递增排序的，试写一算法将值为x的结点插入到表L中，使L仍然有序。 2、设计一算法，逆置带头结点的动态链表L。要求利用原表的结点空间，并要求用尽可能少的时间完成。 3、假设有两个按元素值递增有序的线性表A和B，均以单链表作存储结构，试编写算法将A表和B表归并成一个按元素值递减有序的线性表C，并要求利用原表的空间存放C。 -1, the node is known to take the lead in junction dynamic s