搜索资源列表
Andian_seek
- 一个求二维数组鞍点的实例-a two-dimensional array for the example saddle point
saddlepoint
- 在m×n的矩阵中有一个元素a[i,j]满足下述条件：a[i,j]既是第i行元素中的最小值，又是第j列元素中的最大值（称为鞍点），此程序是求矩阵鞍点的算法
15
- 寻找矩阵鞍点（假设改矩阵至多存在一个鞍点）-Find matrix saddle point (Assuming this matrix up to the existence of a saddle point)
seek-for-saddle-point
- 找出一个m*n数组的鞍点。若找到了鞍点则输出鞍点的行号和列号，若数组不存在，则输出鞍点不存在-seek for saddle point
22
- 若矩阵某位置上的元素在该行上为最小，而在该列上为最大，则称该位置(即行列号)为 矩阵的鞍点。输出给定矩阵中的所有鞍点。 - If a matrix element position on the line is the smallest, and the largest on the column, called the position (ie, ranks No.) is Saddle point matrix. Output for a given matrix of a
andian
- 寻找一个矩阵元素的鞍点的Fortran小程序，根据数据元素是否大于其周围八个点的值判断-Looking for a saddle point of the matrix elements of small Fortran program, according to the data element is larger than the judgment value of the surrounding eight points
andian
- 寻找矩阵的鞍点，即行中元素的元素在其所在列中最大。-Looking saddle point matrix elements that line the elements in their maximum in the column.