一个非常简单的项目代码

离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive integer n and k, calculated (n, k) 01 series of numbers.

回文算法实现,代码已经验证-Palindrome algorithm, code validation

数据结构经典算法的实现-data structure to achieve the classical algorithm

哈夫曼树的建立,haffman 编码,在turbo c 下运行-Huffman Tree, haffman encoding, turbo c in the run

顺序查找 实现顺序查找的设计与实现 且加上了注释 更容易理解和上手-Find the order of search in order to achieve the design and implementation and the addition of annotations easier to understand and get started

欢迎使用是用Visual FoxPro 7.0数据库开发典型实例-welcomed the use of Visual FoxPro 7.0 database development typical examples

数据结构 课件 东软内部资料！！ 给需要的人-Neusoft courseware data structure internal information! ! To those who need it

离散点插值程序，采用的是cressman客观插值原理-discrete points interpolation procedure, the objective is cressman interpolation Principle

语法分析正确后就可以求值了，求值时用到一个操作数堆栈和操作符堆栈，以及一个算符优先表（存储了运算符之间的优先关系），具体细节可以阅读源码。-syntax analysis is correct after it evaluates the value used for a number of operations and the operator stacks stack, and an operator priority list (stored Operators relations between the priority), specific details can be read source.

内存池，如果需要减少长时间、不断开辟小内存的程序产生的内存碎片对程序运行效率的影响，可以使用该类库；-Memory pool, if the need to reduce the time, and constantly open up a small memory memory fragmentation procedures of the process the impact of operating efficiency, you can use the class library