Computer algorithms designed for the design of dynamic programming, you know

算法与数据结构,C语言版严蔚敏,清华大学出版社-algorithms and data structures, C-language version of Yan Wei Min, Qinghua University Press

NexusDB 2.07 Embedded Free Edition (for Delphi2006)

可以在打印之前并在程序内直接设置所有的参数!-in print before the procedure and direct all the parameters set!

求K阶斐波那契序列 一个难得的数据结构示例 有详细注解 适合正在学习数据结构的STU-For K-order Fibonacci sequence a rare example of data structure has detailed annotations are learning the data structure suitable for the STU

1、实时检测用户IP。 2、实时进程号探测。 3、用户超时自动离线。 4、自动来访地址分析。 5、拒绝代理服务器访问。 6、自动数据来源检测。-a real-time detection of IP users. 2, real-time detection of the process. 3, users offline automatic overtime. 4, automatic analysis of visiting addresses. 5, refused to visit the proxy server. 6, automatic detection of data sources.

数制转换，将二进制数转换为十进制数。数制转换-shuzhizhuanhuan

我大三本科做的数据结构课程设计。题目为学生成绩管理系统，有详细的文字说明和源代码。-I do junior undergraduate data structures course design. Entitled to student performance management system, a detailed written instructions and source code.source code.

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,

学生初学，c实现约瑟夫环(圆桌问题)，算法应该不是很高效，望各位高人看了改进改进！-beginner students, c achieve Joseph Central (round table), the algorithm should not be very efficient, a person looking to improve reading improvement!

n!不为0的最后一位，可以输出千万级别的阶乘最后一位-n! not the last one is 0, you can output level factorial million last