宾馆管理信息系统

实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.

迷宫的又一解法。该算法简单、实用、可读性强，是学习递归和回溯很好的例子。-maze of another solution. The algorithm is simple, practical and readable study is recursive and backtracking good example.

数据结构习题集答案，经多次修改而成，比答案册还要清楚简单。-data structure answer to the questions set by several revisions, but clearly the answer List simple.

DBF转换word/excel-dbf chage to word/excel

对二叉树结构作了清晰而简易的演示，可以帮助要了解二叉树结构和基本算法的人加深认识。可用VC直接编译运行。-On the binary tree structure was clear and simple presentation can help to understand the binary tree structure and the people a better understanding of the basic algorithm. VC can be used directly to compile run.

个人桌面电话簿管理-desktop personal telephone directory management

数据结构（C＋＋版）的演示程序，详细演示深度优先搜索的具体调用过程,-data structure (C++ version) demonstration program, a detailed demonstration of the depth-first search to the specific call process,

C++面试试题，值得一看-C interview questions, the eye-catcher

迷宫算法（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.

读取的字符一一 ； 忽略任何不是支架的一些种类; 所有左括号内推入堆栈 ； 为每一个右括号，请确保位于堆栈中的类型相匹配的左的括号和弹出 ； 可能会出现三种错误： 到达最后一步输入的现在还有 （左） 括号在堆栈上 ； 你找到一个右括号中输入，但在堆栈的顶部左的一个不匹配 （即，它不是同一种） ； 您尝试匹配一个右括号与左一个从堆栈，但在堆栈为空 ；