资源列表
Expression-evaluation
- 任意输入数学运算表达式分别采用两种算法求值，分别是中缀表达式直接求值和修改成后缀表达式求值。表达式中包含的运算符有：加法+，减法-，乘法*，除法/，括号()，乘方#等运算符。运算符的优先级和结合性符合数学运算法则-Any input math expressions using two algorithms evaluated, infix expression directly evaluated and modified the postfix expression evaluation.
NOIP
- 关于算法的资料，有不同的解法，比较全面，生动易理解，复习学习的首选资料-Information about the algorithm, a different solution, more comprehensive, lively and easy to understand, review the learning of choice for information. .
Data-structure-(PPt-and-source-code)
- Java数据结构（山东大学），包括课件及对应的完整源代码-data structure in Java language(PPT and source code) of Shandong University
BigIntegerOperation
- 利用string来实现对大整数的加减乘的操作，代码容易理解，供大家参考-Use a string of big integer to realize the sum of the operation of the take, code easier to understand, for your reference
Dijkstra
- 迪杰斯特拉算法的简单实现，供大家参考，代码简洁易懂，数据结构可用-Di jester pull algorithm of simple realization, provide everyone reference, code concise to understand, the structure of the data available
Linear-time-selection
- 线性时间选择代码。算法分析与设计实验习题-Linear time selection code.Algorithm analysis and design of experiments exercises
Data-Structure(yan-wei-min)
- 经典的严魏敏数据结构课后答案，每章都有很详细的答案，很值得大家去学习，有助于理解数据结构-Classic Yan Wei Min data structure after-school answer, each chapter has a very detailed, very worth learning, help to understand the data structure
Floyd
- Floyd的参考算法，采用三层循环，依次比较各个距离，得到各点之间的最短距离，是最短路径规划中的基础算法-Floyd reference algorithm, using the three-cycle in order to compare each distance, the shortest distance between points, is the basis of the shortest path planning algorithm
1
- 常见的动态规划算法的C++实现，包括最长公共子序列 硬笔找零问题的-dynamic algrithem
130.3
- 对给定的单链表L，设计一个算法，删除L中值为X的结点的直接前驱结点-For given single table L, design a algorithm, delete L X for value of the nodes in the direct precursor nodes
huffman-tree
- 赫夫曼树的c++程序，适用于本科c++初学者-huffman tree
pagereplace
- 页面置换算法演示，程序中含有一些对控制台输出和事件进行控制的API函数.-Demo page replacement algorithm, the program contains some of the console output and the control of the incident API function.