simulated people Maze, the main general operating procedures, data structure

毕业生管理系统:分为六个模块：身份验证模块、毕业生资料模块,考试成绩录入模块、通信录及数据输出与系统设置模块、毕业生成绩统计模块、数据库维护模块。-Graduate management systems: divided into six modules: authentication modules, graduates of information modules, examination results entry module, communications were recorded and the data output and system settings module, graduates accomplishments statistics module, database maintenance module.

算法分析，此教程介绍一些常用的算法，比如回溯法，-failed to translate

航空公司管理信息系统-airline management information system

要求完成以下功能： 1)能够从屏幕上读取一个学生的信息并将信息存入到数据文件中。 2)能够将指定的信息从文件中删除。 3)能够按编号、姓名对学生的信息进行检索并将检索结果显示在屏幕上。 4)可以统计全部学生的总成绩，及其在班上的排名。 5)能够统计各科的平均成绩及及格率。 6)要求有错误提示功能，例如性别只能输入男女，输入错误提示重新输入。 7)如果检索不到相应的信息应提示用户。-asked to perform the following functions : 1) to read from the screen of a student"s information will be deposited into the data file. 2) can be designated information deleted from the document. 3), according to numbers, the names of the students will retrieve information retrieval results showed on the screen. 4) Statistical all students can be a total score, and the class rankings. 5) Statistics Branch to the average scores and passing rates. 6) require a functional error messages, such as sex between men and women can only import, importation of error messages to re-enter. 7) If less than the corresponding retrieval of information should prompt the user.

很实用的程序. 用Virtual C++ 6.0做的,实现对声音的采集,处理,从而对MIC的声音进行控制的效果, 本程序是已成功测试通过.-Very useful procedure. Using Virtual C++ 6.0 to do, and realize the sound collection, treatment, thereby to control the voice of MIC results, the procedure is successfully tested.

用c++写一个售货员问题。这是高级算法中除了红黑树中最难的一个了。是研究生课程中的的程序实现-used to write a salesman problem. This is in addition to the High algorithm RED-BLACK TREE which one of the most difficult. The postgraduate courses in the program

这个程序是非常有用的解决矩阵，如果有人想要更多的搜索可以找到这个地址

仿windows优化大师界面（源码）123456-imitation windows optimization master interface (OSS) 123456

这是一个经典的寻找最近点对的算法实现，运用VC编写，采用类的方式，是程序更易理解。-This is a classic look for the nearest point of the algorithm, using VC preparation, the type used, the way the process easier to understand.

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.