统计上参观的游客数量可以记录到该网站的数量…

由系统随机建立一个迷宫,然后屏幕输出路径。为在完成作业的同时复习所学过的内容,完成一条路径的时候用到了递归的方法 而做全部路径的时候用非递归的方法。用户界面友好，有用户使用说明.每一步操作都有说明与提示。程序运行通过，有详细的解释说明-system by the establishment of a random maze, and then screen output path. For the complete review of operations at the same time have learned from the contents of a complete path of the use of recursive method to do all the time path of non- recursive method. User friendly interface, users note. Every step of the operation have notes and hints. Running through a detailed explanation of

教务辅助管理系统利用VB开发的数据库管理系统,里面分学生,教师,教务等等各方面的需求满足学校的教务管理的简单需求!-Senate Assistant Management System Using VB development of the database management system, which, students, teachers, Senate, the areas of the school to meet the needs of the academic management of the simple demand!

Sql，o MYSQL??En programar mas que les 狗屁吗？en el 解释权 o en MYSQL，段 mi es mas 之上 mysql 佩罗苏 consideracion 吗？cual les 狗屁 mas =），y si pueden pasen tutoriales 段 inserciones de cadenas。

数据结构――家谱的实现 本人的课程设计 MFC-data structure-- I literally achieve the curriculum design MFC

计算机数据结构课程设计，图书管理系统c语言版（含有软件设计书）.-Computer data structures curriculum design, library management system c language version (with software design book).

停车场管理系统2（数据结构实习报告）-car park management system 2 (data structure internship report)

计算机编程艺术第一卷，学习算法和数据结构的好书-Art of Computer Programming I, learning algorithm and data structure books

二叉平衡树算法，包括二叉平衡树的数据结构定义、创建、插入、查找、删除、释放内存等方法。-two forks balanced tree algorithms, including two forks balance tree data structure definition, create, insert, search, delete, release methods such as memory.

这个项目对那些想要了解数据库的 java 编程的初学者很有帮助......说明：1.打开控制面板2 单击管理工具(3) 打开 DataSources(ODBC)4.单击添加按钮选择 Microsoft Access Driver(*mdb,*accdb) 单击完成5.在对话框窗口中，用数据库，和那就是 HMS_DB 的名称填充数据源名称字段。6.单击选择按钮来浏览数据库，然后单击确定

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.