代码搜索：矩阵分析
找到约 10,000 项符合「矩阵分析」的源代码
代码结果 10,000
www.eeworm.com/read/382761/9001904
dsw 矩阵计算.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/182772/9191618
cpp 矩阵连乘.cpp
#include
int m[1024][1024];
int p[1024];
int main()
{
int n,r,i,j,k,t;
scanf("%d",&n);
for(i=0;i
www.eeworm.com/read/376627/9311539
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/376627/9311618
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/376627/9311899
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i
www.eeworm.com/read/375828/9348820
c a(蛇行矩阵).c
//蛇行矩阵 蛇行矩阵
#include
void main()
{
float i,j;
int k,n = 1,**A;
printf("Please input one character:\n");
scanf("%d",&k);
A = (int **) malloc(k*sizeof(int *));
for(i = 0;i < k
www.eeworm.com/read/178665/9389227
txt 稀疏矩阵 .txt
/*将稀疏矩阵表示为三元组，求出转置矩阵并输出结果。010650-20030000008000*/
#include
#define Max 1000;
typedef int datatype;
typedef struct node{
int i; /*行*/
int j; /*列*/
datatype k; /*元素*/
}TripleNo
www.eeworm.com/read/363342/9958080
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[