Campus-navigation-system

这是acm里关于魔王语言的一道题，通过栈和队列的知识来解决。(this is balout luciferlanguage . i use the datastructure with stack and queue.)

用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)

基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)

说明：  ACM及各类基本算法模板，包括数据结构，计算几何，字符串，图论，数学，高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)

这是一个实现找出欧拉路径的的算法，比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)

说明：  数据结构实验报告链表的操作，包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)

使用C语言编写的AOV网的拓扑排序，内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)

约瑟夫问题，通过C语言对约瑟夫问题进行了分析和讲解，从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)

说明：  从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)

实验内容： 建立一个包含图书（书号，书名，定价）信息的的链表，并具有如下功能： (1) 根据指定图书个数，逐个输入图书信息； (2) 根据书名进行查找，返回此书的书号和定价； (3) 根据指定的位置可返回相应的图书信息（书号，书名，定价）； (4) 给定一个图书信息，插入到表中指定的位置； (5) 删除指定位置的图书记录； (6) 统计表中图书个数。 (It is a good c++.)