INFORMIX数据库优化SHELL，可以一目了然地发现数据库中的性能问题。...

这是一道典型的动态规划题 提供了三种方法(用C++代码实现)-This a typical dynamic programming that provides three methods (using C code realization)

数据结构中排序的实例分析，可供有兴趣的朋友参考学习-Sort of data structure example of analysis, available to interested friends refer to learning

数据结构试验，包含试验报告和源码，运行能通过，自己写的-Test data structure, including test reports and source code, run through, their own written

一个彩票选号的随即函数值！ 其实，很简单，大家看以下！-a lottery Dip the function immediately! In fact, very simple, we look at the following!

数据库应用之一:车辆管理系统,用Visual FoxPro-One of database applications: vehicle management system, using Visual FoxPro

一个自己定义的数组外包装，这是“使用者自定义stl容器“的一个好例子，在数组之外包装了一层常用的容器界面。-own definition of an array overpack, which is a "user-defined stl containers" of a good example In addition to the array of packaging containers used layer interface.

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

求最短路径的C++ 源代码 ，用很简单的数据结构实现的，运行速度很快-The shortest path for the C++ Source code, using very simple data structure to achieve, to run fast

学生课程管理系统,一个学习数据结构过程中的必备程序。-students information manager

树结构之线索话二叉树，二叉树的存储结构，线索二叉树的构造。中序线索化，递归算法，非递归算法。