OTP的读者

Java编写的大型购物商场源代码-Java prepared by the major shopping malls source code

伙伴系统:avail[0..m]为可利用空间表, n为申请分配量, 若有不小于n的空闲块, 则分配相应的存储块, 并返回其首地址,否则返回NULL -Partner system: avail [0 .. m] can be used for table space, n for the distribution of the volume of applications, if n is not less than the free block, then the distribution of the corresponding storage block, and return to its first address, otherwise return NULL

在0和1情况下进行背包问题解决，涉及多个物体的重量和价值，求得最大价值量以及分配方案。-At 0 and 1 backpack case for problem-solving, involving more than the weight of objects and values, as well as to achieve maximum value distribution program.

PB制作时钟小程序-PB produced small clock procedures

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a

最短路径的具体实现，使用了dikstra算法-Concrete realization of the shortest path, using the algorithm dikstra

DES algorithms library，很经典的DES算法库。-DES algorithms library, the classic DES algorithm library.

完成在ODBC中进行异步调用的C程序源代码，运行环境Windows.-Completed in the ODBC asynchronous calls in C source code, runtime environment Windows.

农业企业数据库是为教育目的而设计的。

它具有一些可以帮助你把病人信息和医生 information，也处理信息的实体您必须使用 xamp、 php、 浏览器...