订单管理系统数据库的源代码，循序渐进，方便易学。

数据结构及算法 对于参加ACM的学生有一定帮助 里面有详细的解答-Data structure and algorithm for ACM students to participate in some help there are detailed answers

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list

二叉数先序循环的非递归实现，一般先序循环都是由递归实现的，按照完全二叉树格式输入字符型结点值-binary sequence a few first cycle of non- recursive, the general first order recursive cycle are achieved, In accordance with the format completely binary tree node input character values

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

源代码，是java实现的，比较清晰和第一部分一起的-Source code, is a java implementation to compare with the clarity and the first part of the

对文件进行文本文件处理 并采用递归法把查到的信息插入到树中-a file processing program, process a file and insert the information from the file to a tree

计算10000以内的阶乘,计算阶乘的程序-calculation 10,000 within the factorial calculated factorial procedure

哈弗曼编码器，含有完整源码。文件的输入与输出。-Havermann encoder, includes full source code. File input and output.

用VB6.0实现的最短路径分析，采用了优化的方法（搜索方向一致性）-Using VB6.0 to achieve the shortest path analysis, using optimization methods (search direction consistency)

这是数据结构的四则运算的c语言程序，只要编译就能运行呀！-This is the data structure of the four operations c language program, as long as the compiler can run!