在线幻灯片产品

给定正整数n，计算出n个元素的集合{1,2,?,n}可以划分为多少个不同的非空子集。 由文件input.txt提供输入数据。文件的第1 行是元素个数n。-Given positive integer n, to calculate a collection of n elements (1,2,?, N) can be divided into the number of different nonempty sets. By providing input data file input.txt. Document line 1 is the number of elements n.

kruskal算法，数据结构中贪心算法的C语言实现。-Kruskal algorithm, data structure of the greedy algorithm in C language.

#include #include struct BiTNode           //定义二叉树结构体 {   float data;   struct BiTNode *lchild;   struct BiTNode *rchild; }; //二叉树创建函数 struct BiTNode *CreateTree(float *preorder,float *inorder,int lenth) {     float *p,*q;      

本代码用贪心算法实现会议安排的最佳顺序，其目标是使得能够安排的会议数量最多，是贪心算法的典型应用-code with the greedy algorithm to achieve the best arrangements for the order, its goal is to arrange the largest number of meetings, the greedy algorithm is a typical application

一个数据结构演示程序，很强大的！！也很好看-a data structure demo program, a very strong! ! Also very good! !

了解设计数据库的基本步骤 熟练使用T-SQL实现建库、建表、加约束 掌握T-SQL编程，实现功能强大的查询 掌握创建索引、视图，快速访问数据库 掌握创建存储过程，实现复杂的业务规则 理解触发器的原理，实现高级的约束,以上摘自幻灯片,这个教程就是关于这一类的-Learn the basic steps of the design of a database of skilled use of T-SQL to achieve the Treasury building, built form, plus bound master T-SQL programming, to achieve a powerful grasp of the query to create the index, view, fast access to the database have to create stored procedures, complex business understanding of the principles of the rules of flip-flop to achieve high-level constraints

本系统是一简单的物资管理系统，能够实现物资的基本信息，入库信息，出库信息，借用情况的管理等功能，适合初学者下载-The system is a simple material management system, able to realize the basic material of information, storage information, a database of information, loan management and other functions, suitable for beginners to download

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 二 运行 1：创建数据库 将TRADE.sql中的SQL语句考入SQL Server的查询分析器中，全部运行； 2：建立ODBC数据源 数据原名称为Trade_MIS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 Second run 1: create a database of SQL statements TRADE.sql admitted to the SQL Server" s Query Analyzer, all running 2: Create ODBC data source data formerly known as Trade_MIS

N-皇后问题线性时间算法 O(n)复杂度，非O(n^2)的，使用的是构造法。-N-Queen problem of linear time algorithm

最简单和最酷的方式来创建类似程序，可以做与 ListView 保存、 加载和修改多个条目与文本的文件的数据库。必须下载此，请参阅如何最简单的这种方法是