I do two large one on object

数据库设计基础 供数据库初学者参考 比较好的资料-Database design based on reference for database beginners relatively good information

凸壳算法，散点成三维体的方法，该方法从洋鬼子那得来的。-convex hull algorithm, scattered dots on the three-dimensional method from the foreign devils that comes from.

线性代数中的矩阵求逆的问题，使用此算法可以简化矩阵的操作。-linear algebra of matrix inversion, the use of this algorithm can be simplified matrix operation.

这里面有二分查找、进制转换、数据结构、货郎担算法、动态网络最短路线等等很多很多的程序-There are binary search, binary conversion, data structure, traveling salesman algorithm, dynamic shortest route network and so on many, many procedures

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());

数据结构中线性表的应用，约瑟夫环算法。便于数据结构的学习。-Linear data structure in the application form, Joseph Ring algorithm. Data structure to facilitate learning

和尚挑水问题（文件内有详细解释） 主要是回溯法的一个好的实例 自己摸索出来的-Monk carrying water issues (the paper has explained in detail) is primarily a good example of backtracking find their own way out of

简单邮电信息管理-simple information management posts

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

这是数据结构算法中的栈的实现的源码。用C++开发。-This is the data structure of the stack algorithm realize the source. With C++ Development.