这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制....

超长整数类及演示程序-long integer type and Demonstration Program

用VC写的模拟内存分配管理的代码,经测试运行完全正确-VC write memory allocation management simulation code, the test run entirely correct

C语言实现数据结构中最短路径的算法代码，有图形显示。欢迎下载-C language data structure, the shortest path algorithm code, a graphical display. Welcome to download

一些简单的小程序，如哈弗曼编辑器，最小生成树，哈希表的设计与实现-Some simple small programs, such as Havermann editor, minimum spanning tree, hash table design and implementation, etc.

DataMatrixDEMO这个工程实现对DataMatrix的编码和解码的过程，识别率非常的高

该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用-The source function is to realize Huffman coding, that is, the optimal tree structure is a character interface, and the sense of self, to do good, debugging adopted, the absolute ease of use

数据结构实验导航图的全部代码，可以实现通过输入查询地址得到相应的路线，还可进行选择

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

Vc++编写的对ODBC数据库操作的源代码。-Vc++ Prepared ODBC database operations on the source code.

反正切函数C实现,一个简单的C语言函数的实现,以及两个math的头文件-Arc tangent function C implementation, a simple implementation of C-language function, and two math header file