01 knapsack problem to achieve the most simple, can do more in its expansion, I...

六级单词数据库编程，压缩包中已带数据库 数据库使用的是Acce-six words database programming, which has been compressed with the use of the database is the database Acce

一个ADO+VC的源码，适用于初学者,里面还有其他控件用法-A ADO+ VC source for beginners, there are other controls usage

db2日常维护汇总-db2 routine maintenance Summary

用VC实现的几个常用的数据结构-with VC several commonly used data structures

数据结构与C语言高级程序设计_0-data structure with the C programming language Huffman High

access the database using Flash MX. Please remember that Flash is unable to natively access a database. A programming language (ASP in this case) provides the programming logic, while Flash works at the presentation tier of the application.

我自己写的数值分析课程设计的算法，这里是数值拟合的部分。-I wrote it myself numerical analysis courses designed algorithm, which is part of the numerical fitting.

是关于好几中有用的算法描述的很有用的-on several useful algorithm described in the very useful

主分量变换，不要密码。-PCA transform, not passwords.

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t