数据库操作 连接odbc的前期操作 或者是对主机的处理工作

algorithm ， tree hash table, b tree, Tas de Fibonnaci-algorithm, tree hash table, b tree, Tas de Fibonnaci

用梯形公式和simpson公式求积分-with trapezoidal formula and simpson formula quadratures

将文件中的字符作为结点，每个字符在文件中出现的频率作为结点的权值，采用Huffman算法构造Huffman树，将字符用尽可能短的二进制数位表示（频率越低，二进制数位越长），而不是用8位的ASCII码进行存储，已达到节省存储空间，压缩文件的目的。

大型数据库系统开发指南,对大型数据库设计做了比较详细的讲解-Large-scale database systems development guidelines, for large database design has done a more detailed explanations

用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing

简单的迷宫算法，数据结构作业，迷宫是自己设定的-Simple maze algorithm, data structure operations, the maze is a set of

严蔚敏的数据结构源码及演示系统，有助于形象直观的学习数据结构-YAN Wei-min source of the data structure and presentation systems, the study will help the image of intuitive data structure

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

著名的15谜游戏（15-puzzle ）的Tcl/Tk版本，现在它可以有 4x4, 5x5 或6x6 的格子，所以更加有趣，改变图片也更加容易。 -mystery of the famous 15 games (15-puzzle) Tcl/Tk editions, it could 4x4, 5x5 or 6x6 lattice, the more interesting and change the picture much easier.

Dijkstra算法， Dijkstra算法，Dijkstra算法-Dijkstra algorithm