可以进行简单的S型座位编排！这是一个数据库应用的小程序，可以继续扩展其功能...

关于最佳贪婪算法的实现 关于最佳贪婪算法的实现-Greedy algorithm on the realization of the best on the best greedy algorithm

把老师给的PPT，上传了。 是说数据结构。-The teacher to the PPT, uploaded. Is that data structure.

约瑟夫环的c语言实现-Josephus in C Language

这是两个集合交并的一个算法-two pools and a reference algorithm

数据结构停车场问题-data structure parking problems

在知道点的坐标或者数量和权重值时，选择最优的路径，这种有的是基于时间有的是基于运费等等，自动找两点路径最短距离！-Know the coordinates of points in the volume and weight or value, the choice of the optimal path, this time based on some because of some freight, etc., automatically find the shortest distance between two points in the path!

一种查找数据库中关于一个字符串的匹配的数据结构-Find a database on a string of matching data structure

我自己用VC++开发的数值算法程序――二次罚函数罚，对于处理带约束的问题效果很好-my own use VC numerical algorithm development process-- second penalty function fines, and dealing with the problem of constrained good results

一个关于公式分析得java小程序，内含全部源代码和接口的详细使用说明，对于学习数据结构的朋友来说，有一定的研究价值。-on a formula of good things java small program that contains all the source code and interface use the detailed, data for studying the structure of a friend, a certain value for research.

从数组中 任取一个元素 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)