数据结构中排序的实例分析，可供有兴趣的朋友参考学习

顺序查找 实现顺序查找的设计与实现 且加上了注释 更容易理解和上手-Find the order of search in order to achieve the design and implementation and the addition of annotations easier to understand and get started

自制C语言贪食蛇小游戏，里面包含两个文件，一个是源程序，一个是图形化驱动，只要两个文件放在一个目录下即可运行，语句简单易懂-Self-made C-Snake game, which contains two files, one source, one is graphical driver, as long as two files in a directory to run, easy to understand statements

难得的好程序，是有关数据库的-rare good procedure, the database

比较六种排序算法，其中包括快速排序，冒泡排序等内容的速度以及空间复杂度。-Comparison of the six sorting algorithms, including quicksort, bubble sort etc. the speed and space complexity.

库存管理系统将自动存储库存明细信息，并在需要时对库存明细信息进行维护和更新

数据结构课程设计，这是我们的最后要上交的课程设计，做的较认真，代码有详细中文解释-Data structure the curriculum design, and this is our last to hand over the curriculum design, to do more serious, detailed English explanation of the code

应用背景可实现交通路线的最优路线；修建主干道路的设计路线；修建网络主干的最优路线等等都可以通过最短路径算法实现关键技术从某个源点到其余各顶点的最短路径，其中有按长度递增的迪杰斯塔拉算法，带权的迪杰特斯拉算法能有效的实现最短路线的设计

berkeley db 数据库中的动态链接库文件，具体使用可以参看4.2.20版本中的相关介绍-berkeley db database

一个效率还可以的配对堆 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)

关于差分方程的一个程序，很简的二维椭圆方程，区域是1x1-differential equations on a procedure for the very simple two-dimensional elliptic equation, the region is 1x1