骑士，在n×n箱在国际象棋的棋盘上，马（骑士）的影响。

Visual basic + sql server2000学员管理系统原代码-Visual basic+ sql server2000 student management system source

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.

大家好，此源中我们将看到在 DBGrid 中使用的例子：

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

均匀分布和高斯分布的C代码-uniform and Gaussian distribution of C code

医学图象处理系统-Medical Image Processing System

一套完整的人力资源管理系统，包括数据库的增删改查,数据库为SQL，封装了所有访问SQL的函数，程序可靠性高， 稍加修改便可使用，可供个人开发和学习使用  一套完整的人力资源管理系统，包括数据库的增删改查,数据库为SQL，封装了所有访问SQL的函数，程序可靠性高， 稍加修改便可使用，可供个人开发和学习使用   

IBM Lotus 123 操作程序例子-IBM Lotus 123 examples of procedures

数据结构的二叉-the binary tree data structure tr