解决N皇后问题的源码及可运行程序，分析各种情况，并输出，直观，有效！...

定义一个栈，并实现栈的基本操作： void Push( const T& x) // bool Pop(T& x) // bool getTop(T& x) const // ostream& operater

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

excel仪表盘，很强大的仪表盘功能，做得很漂亮-excel

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo

关于三层架构的内容参考，三层架构的大致结构内容-With regard to the contents of the reference three-tier architecture

一个用vc写的物资管理系统-vc with a written material management system

算法函数实例，算法1，存放了书中所有的算法函数程序以及例子中的主函数程序-arithmetic functions example, an algorithm, the book store all the arithmetic functions procedures and examples of procedures for the main function

用C++实现二叉树的建立，删除，添加。主要使用的是类的结构。-C realization of the establishment of binary tree, delete, add. The main category is the use of the structure.

计算PI的值有各种各样 ，看看这个算法是不是很简洁呢-Calculated PI values are varied, to see if this algorithm is not very simple and does