搜索资源列表
yuesefu0
- 用c++语言开发的求解著名的约瑟夫问题的程序，属于数学问题处理程序-use language to solve the problem of the famous Joseph procedures, belonging to a mathematical problem handling procedures
ovtoolbox
- The Engineering Vibration Toolbox is a set of educational programs written in Octave by Joseph C. Slater. Also included are a number of help files, demonstration examples, and data files containing raw experimental data. The codes include si
Joseph
- 编号1,2,...n的n个人按顺时针方向围坐在一圈,每人持有一个密码.一开始任选一个正整数作为报数上限值m,从第一个开始按顺时针方向自1开始顺序报数,报到m时停止报数.报m的人出列,将他的密码作为新的m值,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止.
QRTT.rar
- QR方法求赫申伯格矩阵的全部特征值，有例子，检验过，很顺利的,QR method for Joseph Berger Shanghai eigenvalue matrix of all, there are examples of tests, it is smooth
HBBG
- 用初等相似变换将一般实矩阵约化为赫申伯格矩阵-Using elementary similarity transformation will be about the general real matrix into a matrix of Joseph Berger Shanghai
Joseph
- 对约瑟夫问题的求解，适用于初学者熟悉数组函数-Solving the problem of Joseph, for beginners familiar with the array function
ycf
- 约瑟夫环问题求解算法C语言源代码。学习算法的初学者可以-Joseph Ring Problem Solving Algorithm C language source code. Beginner can look at the learning algorithm
ysf
- 用C语言实现解决约瑟夫问题的一种方法，也许会对他人有启示。-C language implementation with a way to solve the problem, Joseph, and perhaps others, would be revealing.
josephringasmallprogramm
- 一个约瑟夫环小程序,练练手可以参照一下。任务：编号是1，2，……,n的n个人按照顺时针方向围坐一圈，每个人只有一个密码（正整数）。一开始任选一个正整数作为报数上限值m,从第一个仍开始顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向的下一个人开始重新从1报数，如此下去，直到所有人全部出列为止。设计一个程序来求出出列顺序。 -Joseph ring a small program and thought they could consult a
yuesefu
- 约瑟夫问题：一群猴围成一圈报数，每报道n，该猴离开，求最后余下猴-Joseph problems: report of a circle Qunhou number of reports each n, the monkeys away, seeking the last remaining monkeys
Newtons-method
- In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function. The algorith
Joseph-algorithm
- 约瑟夫算法：n个人围成一圈，每人有一个各不相同的编号，选择一个人作为起点，然后顺时针从1到k数数，每数到k的人退出圈子，圈子缩小，然后从下一个人继续从1到k数数，重复上面过程。求最后推出圈子的那个人原来的编号。 思路：按照上面的算法让人退出圈子，直到有n-1个人推出圈子，然后得到最后一个退出圈子的人的编号。 程序：坐成一圈的人的编号不需要按序排列-Joseph algorithm: n individuals in a circle, each with a different
Joseph-cyclic-monkeys
- 约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的顺序是：5，4，6，2，3，1。-Joseph problem is a well-known problem: N personal circle, starting the first reported number of M will be killed first, the last remaining one, the rest will be ki
Desktop
- 先序遍历二叉树算法、语音程序模板、约瑟夫数判定、判断素数-void preorder 、voice procedure templet、The Joseph number 、judge a prime number
拉格朗日插值法_matlab
- 数学最优问题中，拉格朗日乘数法（以数学家约瑟夫·路易斯·拉格朗日命名）是一种寻找变量受一个或多个条件所限制的多元函数的极值的方法。(In the mathematical optimization problem, the Lagrange multiplier method (named by the mathematician Joseph Luis Lagrange) is a method of finding the extremum of a multivariate functio