搜索资源列表
Josephus
- 编写一个求解Josephus问题的函数。用整数序列1, 2, 3, ……, n表示顺序围坐在圆桌周围的人。然后使用n = 9, s = 1, m = 5,以及n = 9, s = 1, m = 0,或者n = 9, s = 1, m = 10作为输入数据,检查你的程序的正 确性和健壮性。最后分析所完成算法的时间复杂度。定义JosephusCircle类,其中含完成初始化、报数出圈成 员函数、输出显示等方法。-Josephus write a problem solving function. W
mi
- 有关栈的应用,是对于迷宫求解的非递归方法-The application of the stack, which is the non-recursive method of solving the maze
2.3
- 求解Fibonacci数列的三种方法,一种用常规算法,一种用数组,一种用递归算法-Solving Fibonacci series three methods, a conventional method, an array, a recursive algorithm for
GaussJordan
- 利用高斯约当方法,求解线性方程组,包括VC++源码以及运行程序-Gauss-Jordan
sdfsadfsdafasd123
- Differential Equations (ODE) Solver through Galerkin Method Galerkin方法求解常微分方程组的实现 这个matlab程序通过Galerkin方法求解常微分方程组,当然求解的结果是 Differential Equations (ODE)近似的解。-Differential Equations (ODE) Solver through Galerkin Method Galerkin method for
ant_colony
- 介绍了一种求解复杂优化问题的启发式算法--蚁群算法.该方法通过模拟蚁群对"信息素"的控制和利用进行搜索食物的过程-a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to both symmetric and asymme
Binary
- 二叉树的动态链表存储结构及表示,二叉树的三种遍历算法(递归和非递归两类)运用二叉树三种遍历的方法求解有关问题-Binary tree structure and the dynamics of linked list is stored, said three kinds of binary tree traversal algorithms (recursive and non-recursive types) the use of three kinds of binary tree tra
shenduyouxiansousuoqiumigong
- 深度优先搜索求迷宫问题 采用深度优先搜索的方法求解迷宫问题,方便快捷-Depth-first search order to the maze problem using depth-first search method for solving a maze problem, convenient and quick
xianxingfangchengzu
- 本程序为求解线性方程组的迭代方法,包含雅可比迭代法、高斯-赛德尔迭代法和SOR方法-The procedure for solving linear equations iterative methods, including Jacobi' s iterative method, Gauss- Seidel iteration method and SOR methods
NonRecursiveMaze
- 非递归求解迷宫问题。输入由10组成的迷宫矩阵,用非递归的方法,也就是构建一个栈来记录下走过的路径,找到出口。并把每一步进行输出。-Non-recursive maze solving the problem. Enter the maze formed by 10 matrix, with non-recursive method, that is to build a stack to record the traversed path, find the exit. Furthermore,
inv
- 运用数值分析的方法,对矩阵进行分解,并求解出可逆矩阵的逆-The use of numerical analysis method, matrix decomposition, and solve the inverse of a matrix invertible
5
- 该程序是求解指定年月日的星期数,运用同余方法求解 -The program is the designated date for solving the number of weeks, using the same method for solving I
src
- Java版运算表达式解析器 主要功能: 对有括号的四则运算解析并求解. 支持多种表达式类型 思路: 1.把中缀表达式转化成后缀表达式 2.从后缀表达式得到解 注意: 该版本只支持1.6JDK,如果想替换成1.5JDK改替换LinkedList的几个方法就行了. 详细内容: http://jomper.javaeye.com/blog/464906-Java version of computing expressions parser mai
GenPoly_matric
- 利用线性移位寄存器序列的线性关系,用求解矩阵的方法求解移存器序列的生成多项式-get LFSR sequence prime Polynomial by the line relationship of the sequence
PDEs
- 小波包里面重要的PDEs算法,运用此方法对于方程求解具有较好的结果。-Inside an important PDEs wavelet packet algorithm, using this method for equations with better results.
GMRES
- 求解大型线性方程组的GMRES方法,文件显示了详细的算法和原理-For solving large linear equations of the GMRES method, the file shows the detailed algorithm and theory
Guass
- 高斯全主元消去算法是一种求解一般线性方程组的一种有效方法-Guass
matlab_No4_Jacobi_and_GS
- 西交大数值计算方法上机作业,雅克比和G-S法迭代求解方程组-National Chiao Tung University, West numerical method of machine operation, Jacques ratio and GS iterative method for solving equations
matlab_No5_Newton
- 西交大数值计算方法上机作业,牛顿差值法求解-National Chiao Tung University, West numerical method-on work, Newton Difference Method
lvxingshangwenti
- 旅行商问题,即TSP问题(Traveling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 TSP问题是一个组合优化问题。该问题可以被证明具有NPC计算复杂性。因此,任何能使该问题的求解得以简化的方法,都将受到高度的评价和关注。 -Traveling salesman problem, the T