Written in binary tree using the VC program, simple and clear, easy to use

这是学习和；

用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it

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

矩阵常见算法，C++实现的类，这是个下载的公用类如果侵犯了您的权利，请告诉我。-This class implements some usual operation about matrix.If this pragram being put on the internet infringe upon your right,please tell me.

很短的表达式求值，利用了编译原理里面的只是构建的-A very short version of expression of evaluation, be builted using the principle of the compiler.

邻接表，邻接矩阵的创建以及对它的一些操作等-Adjacency list, adjacency matrix, as well as the creation of some of its operations

小图书馆管理系统，有检索、查看，借书，超期表，还书，赔书等功能，还有按专业统计等，access小程序-small library management system, search, check the library and extended table, book, indemnities, and other functions, there are also professional statistics, the access of small procedures

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.

一个有关于VC++6.0与ACCESS数据库的小程序-1 on VC++6.0 and the ACCESS database, a small program

应用背景图论相关，图论相关算及其应用。邻接表，邻接矩阵 的实现方法，。。图论相关，图论相关算及其应用。邻接表，邻接矩阵 的实现方法图论相关，图论相关算及其应用。邻接表，邻接矩阵 的实现方法关键技术邻接表，邻接矩阵 的实现方法，C++源码 源代码，使用 VS 2010 C++源码 源代码C++源码 源代码 编写的，真麻烦