代码搜索：矩阵分析
找到约 10,000 项符合「矩阵分析」的源代码
代码结果 10,000
www.eeworm.com/read/363342/9958142
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/363342/9958331
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i
www.eeworm.com/read/361582/10044421
txt 矩阵相乘.txt
using System;
public class MatrixMultiply
{
public static void Main()
{
int a,b,c,d;
Console.WriteLine ("该程序将求出两个矩阵的积:");
Console.WriteLine ("请指定矩阵A的行数:");
a=int.Parse (Console.Re
www.eeworm.com/read/421224/10748752
asm 矩阵键盘.asm
;矩阵键盘扫描
;P2.0接行 接上拉电阻到vcc ,P2.7接列
ORG 0000H
LJMP MAIN
ORG 0030H
MAIN: MOV SP,#60H
MOV R7,#0
LOOP: LCALL KEY1 ;调用按键检测子程序
LCALL DISP
SJMP LOOP
KEY: LCALL DISP
MOV P2,#0F0H ;按键检测,
www.eeworm.com/read/276181/10758287
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/276181/10758384
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/276181/10758617
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i
www.eeworm.com/read/420083/10817837
obj 矩阵键盘.obj
www.eeworm.com/read/420083/10817843
pwi 矩阵键盘.pwi
www.eeworm.com/read/420083/10817845
c 矩阵键盘.c
/****************************************/
/* 楼宇0711 */
/* http://www.bloglcz.ccoo.cn */
/* 综合演示程序 */
/* 目标器件：AT89C51 */
/* 晶振：11.0592MHZ */