可以实现两个大整数（不限数位）相加减！ 在C＋＋中，加减法的两个数必须在系统规定内，本程序突破了这一界限！...

该程序能够实现傅立叶的快速转换和放转换用vb语言来实现，整体效果不错！-the procedures to achieve fast Fourier transformation and the conversion put vb language used to achieve the overall effect was excellent!

这是关于古代9连环问题的求解过程，包括安装跟坼卸-This is a chain of nine ancient problem solving process, including the installation of crack with dumping

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

数据结构实验报告！-report!

数据库模式读取delphi源程序，可以读取多种关系数据库-Delphi source code to read the database model, which can be read by a variety of relational database

此程序用的是后缀表达式求值的方法，其中用到了一个栈，而中缀表达式求值需用到两个栈（操作数栈和操作符栈），所以阅读程序前提是了解中缀表达式和后缀表达式 之间的转换，和后缀表达式求值的过程。关于他们之间的转换，我的概括为：中缀表达式：a*（b+c)-d/f  ，先做b+c，即bc+；再做a*（b+c），即abc+*；然后做d/f,即df/; 最后做a*（b+c）-d/f,得abc+*df/-。关于后缀表达式求值过程请参照你的《数据结构指导书》P60~62（下文所指参照页均在此书）。程序里中有些我说的可有可无的东西，我已经说明 程序里只给出了+ - * / 四种运算，其它运算符若需要， 可向程序里插入。你的指导书堆栈实验里提示用到了“运算符重载”，所以添加其他运算时，有可能用到重载，但这里的四则运算我没用到，运算符重载是很重要的

Matlab基础篇是Matlab初学者的一个很好的向导，它介绍了Matlab的安装及初等的使用方法-Matlab Matlab for the project is a good beginner"s guide, it introduced the Matlab the installation and use of primary

本人上传的是用分治法实现的大整数算法，采用的是数组形式。-I uploaded is to use divide and conquer to achieve a large integer arithmetic, using the array form.

一个新的学籍管理系统-a new Academic Information Management System

递归算法求统计二叉树T中叶子结点的数目，数据结构常用算法-recursive algorithm for statistical binary tree T leaf node of the number of commonly used data structures Algorithm