《数据结构与算法》讲义，第3章 栈与队列。 “十一五”国家级规划教材。张铭，王腾蛟，赵海燕，《数据结构与算法》，高教社，2008. 6。...

这是计算机体系结构中用哈夫曼编码进行指令编码的程序，并构建哈夫曼树-This the computer architecture used Huffman coding instructions for coding procedures, and to build Huffman tree! !

该代码可以解决职工的信息管理和工资、奖金的管理系统，同时该管理系统具有很好的数据承载能力，后期的维护工作可能稍微要轻松点的。。。

用c写的数据结构问题-Construction of data question writes which with c

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.

SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.

关于教学管理的数据库-on teaching management database

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

基于二叉树的图最有路径算法，在图能转化到二叉树表示时，可求解-the best path based on binary tree

一个适用于书店的图书管理信息系统，包括各种统计分析、员工管理等-a bookstore in the library management information systems, including statistical analysis, staff management etc.

数据结构(C++描述)电子教案,幻灯片-data structure (C) is the electronic lesson plans, slides