资源列表
sort
- 排序算法示例 快速排序 选择排序 直接插入排序 希尔排序 -sort
HDOJ1201-1250
- HDOJ1201-1250,杭电ACM题目-HDOJ1201-1250, "Hangzhou University of Electronic Science and Technology" ACM topic
xianxingbiao
- 线性表实验报告，包含源码，用于数据结构与算法课程-Linear table test reports, data structures and algorithms course
tu
- 图实验报告，包含源码，用于数据结构与算法课程-Linear table test reports, data structures and algorithms course
tree
- 树的实验报告，用于数据结构与算法课程，包含源代码-An experiment on the tree for the data structures and algorithms courses, including the source code
chazhao
- 查找的实验报告，用于数据结构与算法课程，包含源码-Find the lab reports, for data structures and algorithms courses, including source code
DataStructCode
- 数据结构代码,已经经过调试，都能够运行，请放心使用。-This is the code for the DataStruct.It can be debug
Astart
- A*算法资料，包括算法原理，算法剖析，伪代码，还有一些研究文献。 图像处理方面涉及全局最优最短路径会相当有用-A* algorithm information, including algorithm theory, algorithm analysis, pseudo code, and some literature. Image processing involves the global optimal shortest path will be very useful for
C_Programming_Assignment_Problem_Hungarian_algorit
- C编程设计指派问题匈牙利算法C Programming Assignment Problem Hungarian algorithm-C Programming Assignment Problem Hungarian algorithm
Expression-evaluation
- 利用栈来求解表达式求值问题。用的是算数优先法，设置了两个栈：OPTR,用来寄存运算符；OPND,用以寄存操作数或运算结果。-Usage of the expression evaluation stack to solve the problem. Count method using a priority, set up two stacks: OPTR, for storage operator OPND, for the storage operand or operation resu
Maze(Stack)
- 应用栈求迷宫通路，用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向再继续探索，直至探索到通路为止。-Application stack requirements maze path, using a "brute-force solving" approach, starting from the entrance, along a forward direction to explore, if we go through, the
Expression-evaluation(suffix-method)
- 在栈的思想下，利用后缀表达式解决表达式求值的问题。类似的，可以推广到前缀表达式求值。-Thinking in the stack, using postfix expression evaluation expression to solve the problem. Similarly, the prefix can be extended to expression evaluation.