Tree algorithm, senior data structure must learn a special binary search tree, a...

数据结构及算法经典 vc源码 数据结构及算法经典 vc源码-Classic data structures and algorithms and data structures vc source code vc classical algorithm source data structure and algorithm of the classical source vc

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

素数的求法，用vb编写的-primes for the law, prepared by using vb

一个采用VC+ACCESS开发的酒店管理，以及论文-using a development of the VC ACCESS hotel management, and the papers

VB和ACCESS作的物品管理软件 比较容易分析-VB and Access Management for the items easier analysis software

bm算法是串的一种匹配算法！本源代码介绍了bm算法的c实现。-bm algorithm is a string matching algorithm! Source code introduced bm Algorithm c achieve.

数据结构CAI系统-用C语言开发的教学辅助系统。-data structure CAI system-C language teaching aids development of the system.

穷举密码算法 /在许多情况下我们需要穷举组合的算法，比如密码词典。 //这个算法的关键是密码下标进位的问题。 //另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。 //如果要提高写文件的效率，可以使用缓冲区，分批写入。-Exhaustive Cipher/In many cases we need to exhaustive combinations of algorithms, such as the password dictionary.// This algorithm, the key is password subscript binary problems.// Another example of this statement to write a document relatively low efficiency, in order to reduce the algorithm complexity is not optimized.// If you want to improve the efficiency of writing documents, you can use the buffer, write in batches.

数据结构中实现图的关键路径的算法，是在TC中运行的。-data structure to achieve the critical path map algorithm is run in the TC.

应用背景宿舍管理系统项目将能够为每个学生的房间号码，为每个学生的考勤信息。关键技术安装解压所有文件/文件夹。编辑connect.php并输入数据库信息。复制所有文件/文件夹到您的网站空间。运行create.php创建数据库称为“phptask”和创建的所有数据库表。重命名或删除文件create.php在成功安装。管理员用户的名字是“user123”，与“一”的口令。