online admissions system

关于货箱装船问题的贪婪算法，只是简要描述-Container ship on the issue of greedy algorithm, only a brief description of

这是一个分治法应用和递归的完美体现，它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.

ADO直接读取数据库的编程实例-read directly ADO database programming examples

我们在学习外省市先进经验的基础上，结合教材管理工作实际情况和多年的工作经验，组织了专门人员与协力电脑公司利用Vb6.0程序语言和SQL数据库语言共同开发研制了“河北广播电-we learn advanced experience of other provinces and cities on the basis of materials management with the actual situation, and many years of work experience, organized with the help of specialized personnel computer companies use Vb6.0 programming language and SQL database language jointly developed "Hebei Radio

万年历的算法 c语言-hefty almanac algorithm c language.

分页脚本在 php 中。你可以使用它为订单几页在您的 web 页。例如如果您要实现很多的页数来描述产品，则可以使用此代码。

c_tan:谭浩强编著c语言程序设计一书的c程序源文件-c_tan : Tan c-language compilation of a program design the source files c

以SQL Serverl和VB实现的酒店管理的各种基本要求，功能完善-to SQL and VB Serverl the hotel management of basic requirements, functional improvement

C语言编写的标准链表模板。包含链表的9种基本操作，链表的创建，判断，结点的增加、删除、查找，链表的删除等。-C language linked list of standard templates. Contains the list of nine kinds of basic operation, list creation, judgments node to add, delete, search, delete, etc. the list.

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree