资源列表
3-OptimalBinaryTree
- 最有二叉搜索树生成程序，图形界面演示，VC6.0开发-most binary search tree formation process, a graphical interface presentations, the development of VC6.0
Fortran常用算法程序集-徐士良
- Fortran常用算法程序集-徐士良很不错的一个算法总结-Fortran algorithms commonly used procedures set-XU Shi-liang is a good summing up Algorithm
数据结构算法集C++
- 数据结构常用算法，C++语言，对初学者很有帮助-algorithm commonly used data structures, C language, very useful for beginners
chandfdsggmoney
- 这是一个数据结构中常用的算法,用贪心算法,找钱的的程序,程序虽小,但有一定的意义-This a data structure commonly used algorithm, with greedy algorithm to find money in the process, procedures may be small, but there are certain sense! !
Coddddsade
- 对文件的加密解密的演示程序,主要是练习对文件和字符串的基本操作-document encryption and decryption of the demonstration program, the practice is mainly paper and string for the basic operation
wwwwNOI98
- 这是一道NOT高中组的题目,是我学习数据结构时所做练习,其中有一些算法可以一起学习-This NOT a group of high school subject, and it is studying the data structure when done exercises, some of which algorithm can study together! !
Eidffakght
- 利用BFS算法解八数码问题 在3*3的方格上放着1-8数码，有一空格为0变化规则为空格可以和上，下，右，左四个相邻的数字互换， 至到和目标状态相等， 每一种状态用一个结点表示 而每个结点每次变化最多有四种结点，将这些结点依次入队列中， 例如初始结点S0,入队列后出队，将S0变化最多产生的四种结点S01,S02,S03,S04依次入队列中， 当S01出队后，产生的四种结点S11，S12，S13，S14(实际上不会有四种结点)依次入队， 每次出队时与结束结点相比较，如果
dddgfgExpressidddon
- 输入一个算术表达式,求出其值,要求表达式输入正确,且数字为0到9之间.并且要以 # 结束。-importation of a math expression, calculated value, the correct expression input requirements and the number of between 0-9. And to the end #.
BinSortTree
- 这里我在学习数据结构时的练习,主要是二叉排序树的基本操作-here in my study data structure of exercises, mainly binary tree sort of basic operation
nurbs++-3.0.11.tar
- 非均匀有理b样条曲线nurbs的C＋＋源码库。 3.0.11版-non-uniform rational b-spline NURBS curves of the C + + source library. Version 3.0.11
编辑距离问题
- 此算法也是非常常用的算法之一,在这个算法中我们特别要明白编辑距离问题的实质所在.-This algorithm is very commonly used algorithm, the algorithm in particular, we need to understand edit distance the real problem lies.
最大k乘积问题
- 相信很多人都有对此算法有过详细的了解,确实这个算法最K乘积问题应用的还是很广泛的-believe that a lot of people have this algorithm in detail with the understanding that this is indeed the most K algorithm application of the product or issue a very broad