MM1队列模拟

《数据结构与算法分析+C 2B 2B+描述+第三版》答案-answer

这是我帮同学做的一个链表操作的演示程序，可以模拟链表的插入删除-This is what I do to help students operate a chain of demonstration program, it is possible to simulate the insertion deletion Chain

八皇后问题，回溯算法的经典例子，此程序可以扩展至n皇后问题。-eight Queen"s problems, backtracking algorithms classic example of this procedure can be extended to n Queen"s problem.

栈的操作与应用 定界符配对检查 中缀转后缀并求值-stack operation and application delimiter matching inspection superintendent to seek value and Suffix

根据一段给定的文章构造哈夫曼树并对一段给出的代码译码成为一段文章，输入输出均通过文件来实现，并配有报告文档。-According to the article section of a given structure of the Huffman tree is given a section of the code decoding to become a section of articles, input and output are achieved through the document and the document with the report.

对二叉树结构作了清晰而简易的演示，可以帮助要了解二叉树结构和基本算法的人加深认识。可用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.

常用的C++数据结构算法,包括队列、堆栈、链表...等.以模板类型式实现-C common data structure algorithms, including queue, stack, etc. List .... To achieve template-type

程序C++双链表算法代码-procedures List C-code Algorithm

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

数据结构一元多项式的实现-data structure of one yuan achieve polynomial