单比特树查找算法，是用于路由查找的，内含有路由查找相关资料...

大数相乘算法,使用C++语言在VC下实现.-large numbers multiply algorithm, the use of C language in the VC achieve.

银行家算法！这是一各比较简单的银行家算法，是在c 语言的环境下开发的！-Banker

数据结构(C++描述)电子教案,幻灯片-data structure (C) is the electronic lesson plans, slides

一个Oracle性能监视工具，含几个sql文件- A Oracle performance surveillance tool, contains several sql document

是一个表达式求值的算法，用 模板实现的，可以进行四则运算，支持小数和括号-is an expression evaluates the algorithm, using the template, can be four operators, and parentheses minority support

本代码是约瑟夫环的循环链表实现方法,可以帮助理解约瑟夫环的基本原理,及其实现-This code is Joseph Central List realize the cycle method, can help to understand the basic principles of Joseph Ring, and its realization

用链表实现多项式的加法与乘法，链表是采用数据结构里面的单链表-polynomial with the addition and multiplication, linked list data structure is used inside the single-linked list

一个中国移动话费查询的例子，对初学者有帮助。-China Mobile calls an inquiry example, help for beginners.

开发工具 Informix-4gl- Development kit Informix-4gl

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.