Airlinereservationsystem

通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)

高德纳发明的高效数据结构dancing link，这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)

实现迷宫搜索程序。迷宫数据从文件输入。输出迷宫路径。 a) 实现从入口到出口的输出顺序； b) 能否打印行走方向（向左、向右、向前）， 如： 1 先前 2 向右 6 向左 7； (Maze searching)

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

校园导航系统包含佛山科技学院本部校区的校园景点平面图。通过系统的各功能不仅可以查询任意景点的编号，名称，简介等信息，还可以查询任意两景点间的最短路径及长度和所有路径及长度。另外，还可以通过一系列操作增加，更改或删除任意的景点的各信息。(Contains the campus attractions plan of the campus Foshan Institute of Technology campus navigation system. Through the function of the system not only can query any spots number, name, profile and other information, can also query the shortest path and arbitrary length between two spots and all paths and the length of. In addition, can also increase through a series of operations, the information change or delete any of the attractions.)

C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

2008软件公司面试题:排序大全：简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序（利用递归）(2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive))

数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)

演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo )