Array

数据结构中的贪心法装箱问题，结果给出装箱的办法和每个箱的容量。-Data structure in the bin-packing problem greedy method, the result is given packing methods and the capacity of each box.

用C++Builder写的数据结构队列问题的程序。希望对大家有用。-C Builder write queue data structure of the proceedings. We hope that the right useful.

数据结构《数据结构(c++描述)》教材习题解答-data structure "data structure (c) is" teaching to answer the questions

我做Excel报表，很老了Rksvr.ini文件文档在以下设置中，您必须更改实际的目录系统[syspath]=D:excelu sample1 temporary=D:excelu sample1与此相关的图片如下：点击查看文档忘记注意这是因为在vfp6下写入，所以选择对vfp8语句稍加改动，请自行修改

一本介绍各种算法的经典书籍，计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)

设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)

改进爬山算法，用于风力发电机实现风能最大追踪，找到最佳叶尖速比，实现最大功率(modified hill-climbing algorithm for wind turbine with MPPT)

皇后控制问题 皇后控制问题-Queen

这个项目是由 ms access 数据库注册系统组成。该数据库包含用户名、 密码、 名字和姓氏。该代码是在 vb.net 中。

八数码难题用vc++编写-eight digital problem with the preparation vc