/ k* Product of the biggest problems Description : I set up is a n

Ora10GSQLReference oracle10gSQL语言参考-Ora10GSQLReference

将马随即放在国际象棋的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.

堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程-Realize stack code, realize all the features of the stack, PUSH, POP, insertion, destruction, empty and so on, have a debugger, you can clearly see the operation of the process stack

使用汇编写的二叉树遍历，我用的是按层存储算法，容易理解-was compiled using the binary tree traversal, I used is based on the storage layer algorithm, easy to understand

计算Fugit的二叉树期权方法 use Fugit binomial tree to calculate option value-Fugit calculation method of binary tree options use Fugit binomial tree to calculate option value

数据库操作类,封装了BDE数据库操作的所有方法。 编译环境 C++ Builder6 下通过。-database operations, a package of database operation BDE all methods. C compiler environment Builder6 through.

Java写的部分数据结构源码-Written in Java source code part of the data structure

仿windows优化大师界面（源码）123456-imitation windows optimization master interface (OSS) 123456

一个二叉树的三叉链表运用实例，求出叶子的结点并输出从根结点到该叶子结点的路径!-a binary tree using the trigeminal Chain example, the leaves are obtained and the output node from the Root of leaf nodes in the path!

joseph的程序对很多C初学者有着很大的帮助，用C++程序实现的-many of the procedures C beginners have great help with the C Programming