polynomial

魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)

程序可以实现哈弗曼自动编码功能！很详细的！很有参考价值！(Program can be Havermann automatic coding features! Very detailed! A good reference!)

数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)

floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)

图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

说明：  贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)

哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)

讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)