利用MD5函数产生随机的无碰撞的像素选择策略

（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来自bi), 第4行存放0或１（０代表作业序号未进入最优调度方案；１代表作业序号已进入最优调度方案） （２） 排序完后，按课本所述方法求一种最优调度方案，存放在S中。 -(1) with a 4* 20 two-dimensional array M, the first a line to deposit a small to large order of 20 given by ai and bi, line 2 store operation corresponding serial number, the first three lines deposited one or 2 (a representative from the ai, 2 representatives from the bi), the first four rows stored 0 or 1 (0 for job number to gain access to optimal scheduling programs a job number has been entered on behalf of the optimal scheduling scheme) ( 2) Sort exhausted, according to the methods described in textbooks, seeking the optimal scheduling of a program stored in the S in.

数据结构C++语言描述--应用标准模板库-Data Structures C++ language description- Application of Standard Template Library

清华大学数据结构讲义-data structure lectures Tsinghua University

数据结构电子书,清华大学出版社,严蔚敏老师-Data Structure e-books, Tsinghua University Press, YAN Wei-min Teachers

该软件模拟数据结构的算法实现-the software simulation data structure Algorithm

学籍管理信息系统-expulsion Management Information System

prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。-prim algorithm using the principle of Minimum Spanning Tree Algorithm prim. Application of organic prim and storage arrays spanning tree.

vfp表单，设置操作员的权限。（压缩文件）-Probe form, a set of operator competence. (Compressed files)

次代码是实现平衡二叉树的数据结构算法。参考的是严蔚敏c和c++数据结构书上的思想。经过调试可以连续实现删除、插入、查找算法-Sub-code is to achieve a balanced binary tree data structure algorithms. Reference is Yan Wei-Min c and c++ data structure book ideas. Debugging can be achieved through a continuous delete, insert, search algorithm

ASP 购物站点管理员选项。 此示例演示一个原油的虚拟购物车，包括内联网 （或后台管理）。