adjoining table with no plans to the depth

该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.

一个三层应用程序，演示如何通过ADO对象以及存储在SQL Server中的Procedure实现高性能的数据访问(在运行程序前首先要设置SQL Server，在压缩包中有一个Procs.sql的文件，首先在SQL Server上运行该文件设置SQL Server数据库)-a three-tier applications, demonstrating how ADO and SQL Server stored in the Procedure to achieve high-performance data access (in the first before running the program to set up SQL Server, in a compressed Procs.sql a document, the first in SQL Server running on the document set up SQL Server database)

用c写的对矩阵求逆的算法，采用直接迭代，适合2阶和3阶矩阵-used to write the right matrix inversion algorithm, the introduction of direct iteration, for two bands and three bands Matrix

数据结构停车场问题-data structure parking problems

利用栈的方式完成车厢调度,数据结构的实习题目,已完成基本内容.-Completes the compartment dispatch using the stack way,Construction of data practice topic,Has completed the basic content

ssd7的本人的答案， 供大家参考, 希望大家喜欢-ssd7 exercise1

K平均聚类法，比较好用，又需要的赶紧下吧-K-clustering method to compare easy to use, but also hastened to the needs of the next bar

实现构造哈夫曼树的哈夫曼算法。 求解出所构造的哈夫曼 使用树的带权路径长度。 -Huffman tree structure to achieve the Huffman algorithm. Solving the structure of the Huffman tree with the right to use the path length.

北大OJ 1417题的标程代码，并查集和深度优先搜索的经典实现-OJ 1417 North title scalar-way code and search sets and the classic depth-first search to achieve

C++数据结构图结构的类定义及有关算法-C data structure definition of the class structure and the algorithm