Huffman tree set up, and then leaves to the root by the Huffman encoding impleme...

pb 源码 实用例子 取硬盘序列号-pb source of practical examples from hard drive serial number

单链表倒序 ，多个栈公用一块存储空间，以及迷宫问题的求解 -Single linked list in reverse order, more than a stack of public storage space, as well as solving a maze problem

资源描述本代码比较适合初学者，刚接触过C++语言的童鞋，对代码不是怎么懂，可以参考学习。

一个自己用C编的关于贪婪算法的例子，压缩包里带有原题目与原测试数据-they use a C series of examples of the greedy algorithm, compressed bundle with the original title and the original test data

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)

编写我们自己的miniSQL代码，几周前没有调试

关于dss系统，即提供pmis系统和做erp系统。

一个快速查询控件，不直接与数据库发生关系，查询速度极快，值得一试-A quick query controls, not a relationship directly with the database, query speed, it is worth a try

TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.

内部排序的所有算法，而且有相关可执行例子，包括插入排序，选择排序，希尔排序，快速排序，堆排序，归并排序等，很全，很孀。-sequencing of all internal algorithm, but is related to the executable examples, including insertion sort, select, in order of ranking Hill, the quick sort, heap sort, merging sequencing, all very, very widow.