我的数据结构的实验题，停车场，用栈和队列 模拟停车场，实现进车和出车

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

简单介绍了一种数据结构的构建及其使用情况,-introduces a simple data structure of the building and its use,

vc访问多个数据库。-vc visit multiple databases.

设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。-Design a project, from AOE network, and data entered into the computer, using the procedure for analysis.

采用VB6.0实现TIN的另一种构建算法：凸闭包构建TIN算法-TIN using VB6.0 to achieve another building algorithms: convex closure algorithm for building a TIN

我希望这个项目能给大学生带来好感

采用水晶报表组件，vb报表应用实例，程序仅供参考。-Using Crystal Reports component, vb reporting application example, the program for reference only.

应用背景运用VC6.0平台采用C++语言编写的农夫携带狼羊菜从河的 一岸过到另一岸关键技术用二进制数字符表示农夫和狼羊菜的位置，采用图的深度优先、数组、和实现的

一个算法问题包括，一些数据结构的算法，全部是已经编译通过的源码，且是我自己写的！- An algorithm question includes, some constructions of data algorithms, completely were already translated through the source codes, was precisely I writes!

数据结构中栈的经典算法――第二类背包问题，已经通过测试！-The stack data structure in the classic method- II knapsack problem, has passed the test!