代码搜索：矩阵分析
找到约 10,000 项符合「矩阵分析」的源代码
代码结果 10,000
www.eeworm.com/read/339832/12201946
矩阵键盘显示
www.eeworm.com/read/233105/14169140
c 逆矩阵.c
#define N 5 /*[注]：修改6为你所要的矩阵阶数*/
#include "stdio.h"
#include "conio.h"
/*js()函数用于计算行列式,通过递归算法实现*/
int js(s,n)
int s[][N],n;
{int z,j,k,r,total=0;
int b[N][N];/*b[N][N]用于存放，在矩阵s[
www.eeworm.com/read/233105/14169231
c 乘法矩阵.c
#include
void main()
{
int i,j;
int big[8][8];
for (i = 0;i < 8;i++) /*循环嵌套*/
for (j = 0;j < 8;j++)
big[i][j] = i * j; /* 乘法表 */
big[2][6] = 748;
www.eeworm.com/read/233105/14169435
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i
www.eeworm.com/read/126707/14406184
cpp 矩阵连乘.cpp
#include
#include
using namespace std;
class Matrix
{
public:
Matrix(int);
Matrix(const Matrix&);
Matrix& operator=(const Matrix&);
int operator()(in
www.eeworm.com/read/227639/14418665
c 逆矩阵.c
#define N 5 /*[注]：修改6为你所要的矩阵阶数*/
#include "stdio.h"
#include "conio.h"
/*js()函数用于计算行列式,通过递归算法实现*/
int js(s,n)
int s[][N],n;
{int z,j,k,r,total=0;
int b[N][N];/*b[N][N]用于存放，在矩阵s[
www.eeworm.com/read/227639/14418727
c 乘法矩阵.c
#include
void main()
{
int i,j;
int big[8][8];
for (i = 0;i < 8;i++) /*循环嵌套*/
for (j = 0;j < 8;j++)
big[i][j] = i * j; /* 乘法表 */
big[2][6] = 748;
www.eeworm.com/read/227639/14418926
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i
www.eeworm.com/read/222763/14675049
pdf 矩阵运算.pdf
www.eeworm.com/read/122580/14682292
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i