用链表实现的大数阶乘，可以计算n万的阶乘，不过3万以上，时间就很长了。...

本代码包包含有各种各样的常用算法代码,你可以在里面找到你所要的-the code packs containing a wide range of commonly used algorithm code, you can still find what you want

MFC实现的图书馆管理系统，希望对大家有用。-MFC library management system to achieve the hope for all of us.

汉诺塔是初学数据结构的同学最头疼的问题，这里是一个用递归函数解决汉诺塔问题的经典c语言程序，里面有代码和执行文件。-HANOR data structure is that when the students most headaches, here is a solution using a recursive function HANOR a classic c language program, which has code and the implementation document.

程序，很好的程序-procedures are good procedures

简单的演示,N的大小可以改变的,而且这个程序的速度还可以, 比以前我用递归写的那个快多了.如果N改得太大输出会有问题， 因为我用到gotoxy的,这个程序主要是练一个算法-simple demonstration, N size can be changed, but the rate of this procedure can also, than in the past I used to write a recursive that quicker. If N is too big change in exports, gotoxy because I used, the process is mainly a training algorithm

数据结构课程设计，这是我们的最后要上交的课程设计，做的较认真，代码有详细中文解释-Data structure the curriculum design, and this is our last to hand over the curriculum design, to do more serious, detailed English explanation of the code

(一) 编写一个程序LAGO7-1.CPP，实现二叉树的各种运算，并在此基础上设计一个主程序完成如下功能。 （1） 输出二叉树B； （2） 输出二叉树B的深度； （3） 输出H结点的左、右孩子结点值； （4） 输出二叉树B的宽度； （5） 输出二叉树B的结点个数； 输出二叉树B的叶子结点个数 -(A) to prepare a program LAGO7-1.CPP, to achieve a variety of binary operations, and on this basis, design a main program performs the following functions. (1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes left and right child node value (4) outputs a binary tree B, width (5) output node B, the number of binary trees (6) outputs a binary tree B, the number of leaf nodes

一个包装好的树型模板类,可以实例化树型数据结构.-a packed tree template category, examples of the tree data structure.

ＰＯＪ　２２７１的己ＡＣ代码．．．不信你可以自己试试．-POJ 2271

编辑数据库表格,可以显示图形及打印-edit database forms, and can display graphics print