施伯乐@黄皮书《数据结构教程》part3

数据结构中哈夫曼编码应用实例,C语言编码。-Data structure in application of Huffman coding, C language code.

站长以前写的informix通用开发包源码，用c和ec编写-common code for infomrix,c and ec

ADO&VC&SQL的例子，很经典-ADO

静态sql详细介绍了数据库结构数据库相关的内容，重点介绍和解释了sql语言的使用-Static sql database structure described in detail the contents of the database-related, focusing on and explain the use of language sql

最小生成树问题用lingo9.0程序实现-Minimum spanning tree problem lingo9.0 procedures used to achieve

this is a zip file contain a program for design of deep foundation with excel.

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-Scheduling multi-course meet the requirements of Pre-curriculum can be given a variety of arranging schedule the program! ! The highlight of this program can be drawn from a group of courses in all possible topological sort, so the end result is a multi-program! !

 ；/*用于多文本直方图的Visual C#2010代码。

几种常用排序算法的效率比较,通过测试可得出这几种排序算法的优劣.-several commonly used algorithm efficiency comparison, the test may come this algorithm several merits.