仓库管理系统简单版

希尔排序(缩小增量法) 排序过程：先取一个正整数d1

数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.

一个基于foxbase小程序，现在用的已经不多了，但是希望还有用-a small program using the already limited, but also with hope

8数码问题，我本科毕业设计，vc6.0制作，可动态演示！-eight digital, I graduated design, vc6.0 production, dynamic demo!

这是一个基于OPENCV,寻找运动目标轮廓，以实现视频流的运动目标检测为目的Delphi例子。 并带有Delphi与OpenCv的编程接口。-This is based on OPENCV, search for moving object silhouette in order to achieve video streaming of moving target detection for the purpose of Delphi examples. OpenCv with Delphi and the programming interface.

这是一个很好的数据库编程！-This is a very good database programming!

六级单词数据库编程，压缩包中已带数据库 数据库使用的是Acce-six words database programming, which has been compressed with the use of the database is the database Acce

linearlist线性表的源代码数据结构需要的-Linear List linearlist source code data structure needed

杂货店管理原代码(商业代码，vb6.0编写)-grocery store source code management (commercial code, vb6.0 preparation)

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20