K阶菲波那契算法，运用环形队列实现，空间是K+1

strassen算法的扩展，可以计算任何偶数阶矩阵的相乘，一般strassen只能计算2的n次方阶（自己编写，英文注释~）-Strassen expansion algorithm can even order any calculation of matrix multiplication, general Strassen only two terms of the n-th-order (to prepare themselves, English Notes ~)

c语言数据结构源代码（全）相当经典-c language data structure source code (all) is a classic

unix上的ODBC实现-unix on ODBC to achieve

这是我上个学期操作系统的课程设计，做了一个多级文件系统，用文件模拟磁盘，基于i节点结构，功能超强，希望对大家有用。-This is my last semester of courses operating system design and a multi-level file system, disk using simulated document, based on i node structure, function superpower, we hope that the right useful.

图论中最小生成树Kruskal算法 及画图程序 M-函数-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function

直接插入排序 排序过程：整个排序过程为n-1趟插入，即先将序列中第1个记录看成是一个有序子序列，然后从第2个记录开始，逐个进行插入，直至整个序列有序-Direct Insertion Sort to sort the process: the whole process of sorting times for the n-1 insert, that is, first sequence of the first one recorded as an orderly sequence, and then from the first two records began to insert one by one until the entire sequence has Preface

一个简单的数据库管理系统,是用delphi开发的.-a simple database management system, is to use Delphi development.

PB对象连接与嵌入-PB Object Linking and Embedding

单链表倒序 ，多个栈公用一块存储空间，以及迷宫问题的求解 -Single linked list in reverse order, more than a stack of public storage space, as well as solving a maze problem

中序遍历输出二叉树 输出二叉树的叶子树 输出二叉树的节点数-which preorder output binary tree output binary tree leaf tree output binary tree nodes