HOFFMAN algorithm to achieve a simple process, we hope to learn useful

约契夫约程序课程设计-about administer procedures curriculum design

界面很漂亮 功能很全哦4． 利用静态数组（或链表）实现通讯录管理，数组的每一个元素是结构体类型，通过这个例子了解数据库管理的基本功能，重点掌握数组元素为结构体的应用、数组坐函数参数、文件读写、自定义函数等知识，这里主要包括输入、显示、查找、删除、插入、保存、读入、排序等功能-Interface function is very beautiful, oh-wide 4. Use a static array (or list) to address book management, each array element is the type of structure, through this example to understand the basic functions of database management, focusing on the array elements to master the structure of applications, an array of function parameters to sit, document reading write, custom function, such as knowledge, here mainly include input, display, search, delete, insert, save, read, sorting and other functions

GDI+编程必备的源码库，包含GDI+各个方面的编程示例，VC 6.0 下编译成功

趋势控件可用于科学，工业监控，数据采集，股市分析等领域的数据显示、分析、打印 -trends controls can be used for scientific, industrial control, data acquisition, analysis of the stock market in the areas of data, analysis, Print

本程序实现pascal语言的语法分析，采用递归向下的分析方法。值得新手一看。-the program pascal language syntax analysis, the use of recursive downward analysis method. Newcomers worth a look.

ISDA Credit Default Swap (CDS) Model (Excel and C)

使用Directx 制作的3D地球-use Directx produced by the Earth 3D

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

Super控件：几行代码控制定制菜单、系统信息、托盘区图表、气泡提示等复杂功能。控件+源码-Super control : a few lines of code customized menu system information, tray tables, bubble suggested other complex functions. Source Control

.txt文件转为.html文件的程序代码-. txt file to. html file code