集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得...

ADOClient通过ADO调用后台数据库，支持ORACLE，MSSQL，ACCESS等数据库-ADOClient

简单的网站设计，适用于初学者，所以共享共享一下！-A simple website design, suitable for beginners, so share share what!

vb多媒体数据库例子-vb examples of multimedia database

ADO数据库编程的一些资料，自己搜集的，希望所帮助。-ADO database programming some of the information that they collect, and I hope to help.

数据结构学习中很重要的一章顺序栈，代码简单易懂-Data structure to learn a very important chapter of the order of the stack, easy-to-read code

hash排序，用hash法进行字符或数字的排序。-hash

在 m 表示的资源数 sj ； t代表机 Mj 的速度在时间间隔 [t; t + 1)。我们可以万无一失地想当然不失一般性，处理器速度的变化不在规格内 ed 间隔

哈夫曼树算法 根据给定的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

数据结构及算法经典 vc源码 数据结构及算法经典 vc源码-Classic data structures and algorithms and data structures vc source code vc classical algorithm source data structure and algorithm of the classical source vc

delphi写的读股票K线源代码-stock was read source code K Line