Prim 算法寻找最小生成树，用C语言实现，有完整的注释！

一个用来储存资料的数据库用C++builder 与jet 4.0编写-used to store a database with information on the C jet builder with 4.0 preparation

一个用vc写的物资管理系统-vc with a written material management system

java 数据结构与算法译作者： [美]Clifford A.Shaffer著 张铭 刘晓丹译 　　包含范围：Java算法 　　尽管基本上Java图书都是讲Java本身的特性。因为Java的体系太庞大了，而用Java来实现的数据结构与算法，这本书也是唯一一本，所以尽管这本不是那么的好但还是做以推荐 -java construction of data and algorithm translated work: [ Is beautiful ] Clifford A.Shaffer inscription Liu Xiao Dan to translate Contains the scope: Java algorithm Although the basically Java books all speak the Java itself characteristic. Because of Java system too huge, but construction of data and algorithm which realizes with Java, this book also is only 11, therefore although this originally is not such is good but or does recommends

这是我本人编写的一个32位定点小数运算的函数库。对于没有浮点运算器的场合，可以提供进行小数运算的一种途径-This is my prepared in a 32-bit fixed point decimal computing functions. For no floating point unit occasions, it can provide for fractional arithmetic, as a way to

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.

ADO操作SQL数据库编程完整案例-ADO operation SQL Database Programming integrity cases

Fibonacci函数-Fibonacci function

易经起名卦例的存取,用户可以方便存取原名和改后的名字信息-database development,use vc++ and mfc software develop,give all source,user can get and store his name and change name conveniently

数据结构（Java语言版）-data structure (Java version)

将马随即放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,……,64依次填入一个8×8的方阵，输出之。-Ma immediately on the international chess 8 8 chessboard Board [8] [8] of a box, MA by the rules of chess go mobile. Requires each box only entered once traveled chessboard all 64 box. Preparation of non- recursive procedure, and seeking stepped routes, with a calculated routes, the figures 1, 2, ..., 64 were filled an 8 x 8 matrix, put it out.