-
高斯-约旦代码
这个程序做了一个gauss-jordan算法，首先你需要介绍你要用多少个表达式，然后你介绍每一个表达式的系数，然后程序给你一个gauss-jordan过程的数组，在计算方法时，可以观察不同的过程。最后，你可以看到真正的解决方案，如果你有3个ecuations，你将有a，b和c。这个程序不会验证当你介绍一个字母。
- 2022-01-25 15:56:13下载
- 积分：1
-
a description of the problem is : No. 1, 2, ..., n n clockwise direction by indi...
约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.
- 2022-02-03 16:31:48下载
- 积分：1
-
算断裂的，可以试试。QMG2.0 is written by
S. Vavasis (and others mentioned in src files)...
算断裂的，可以试试。QMG2.0 is written by
S. Vavasis (and others mentioned in src files) and is copyrighted (c)
1999 by Cornell University.-Operator faults, you can try. QMG2.0 is written byS. Vavasis (and others mentioned in src files) and is copyrighted (c) 1999 by Cornell University.
- 2022-01-27 17:07:10下载
- 积分：1
-
我们的一个非线性振动课的作业，希望大家能用上啊！
我们的一个非线性振动课的作业，希望大家能用上啊！-Of our non-linear vibration of a homework assignment, hope everyone can be on the ah!
- 2022-12-07 03:45:03下载
- 积分：1
-
算法设计与分析 哈夫曼树及哈夫曼编码 贪心算法
一个记录字符及出现频率的文件如下所示：huffman.haf7a,45b,13c,12d,16e,89f,34g,20试编写一个读取此种格式文件类CHuffman, 内部机制采用优先队列，用于建立Huffman树及进行Huffman编码输出，其用法可以如下所示： CHuffman hm("hu
- 2022-03-10 07:52:22下载
- 积分：1
-
[ [复杂矩阵：语言] ]
[[ Complex Matrices : Language c]]
- 2022-06-11 16:19:06下载
- 积分：1
-
求解非线性不动点方程组x=G(x)的非线性塞德尔迭代方法，初值x0...
求解非线性不动点方程组x=G(x)的非线性塞德尔迭代方法，初值x0-For solving nonlinear fixed point equation x = G (x) the nonlinear Seidel iterative method, initial value x0
- 2022-08-11 02:55:05下载
- 积分：1
-
设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。这里所说的字符操作包括：
1. 删除一个字符
2. 插入一个字符
3. 将一个字符...
设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。这里所说的字符操作包括：
1. 删除一个字符
2. 插入一个字符
3. 将一个字符改为另一个字符
将字符串A变换为字符串B所用的最少操作数称为A到B的编辑距离，极为d(A,B)。设计一个算法，计算任意两个字符串的编辑距离。
-Set A and B are two strings. Operation will use the least character string A is converted to a string B. Operation of characters are talking about here include: 1. Delete a character 2. Insert a character 3. Will be replaced by one character to another character will be transformed into a string A string of at least B operand used by A to B is called the edit distance is extremely d (A, B). Design an algorithm to calculate any two of the string edit distance.
- 2022-01-26 03:32:59下载
- 积分：1
-
数值处理算法源代码
数值处理算法源代码-numerical algorithm source code
- 2022-04-12 19:01:13下载
- 积分：1
-
一个马尔可夫模型的源码
一个马尔可夫模型的源码-a Markov model of the source
- 2022-02-10 05:53:35下载
- 积分：1
