代码搜索：矩阵分析
找到约 10,000 项符合「矩阵分析」的源代码
代码结果 10,000
www.eeworm.com/read/26985/975712
lst 矩阵键盘.lst
C51 COMPILER V7.50 __阵键盘 08/24/2011 11:40:31 PAGE 1
C51 COMPILER V7.50, COMPILATION OF MODULE __阵键盘
OBJECT MODULE PLACED IN 矩阵键盘
www.eeworm.com/read/26985/975713
plg 矩阵键盘.plg
礦ision3 Build Log
Project:
C:\Documents and Settings\Administrator\桌面\程序代码\11矩阵键盘\矩阵键盘.uv2
Project File Date: 08/18/2011
Output:
www.eeworm.com/read/27652/987461
_c 矩阵键盘._c
#include
#include
#define uchar unsigned char
#define uint unsigned int
#pragma data:code
const table[]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d, 0x07,
0x7f,0x
www.eeworm.com/read/27652/987464
lis 矩阵键盘.lis
.module _矩阵键盘.c
.area text(rom, con, rel)
0000 .dbfile 矩阵键盘.c
.area data(ram, con, rel)
0000
www.eeworm.com/read/27652/987468
c 矩阵键盘.c
#include
#include
#define uchar unsigned char
#define uint unsigned int
uchar const table[]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d, 0x07,
0x7f,0x6f,0x77,0x7c
www.eeworm.com/read/327496/3455272
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/327496/3455302
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/327496/3455381
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i
www.eeworm.com/read/382780/2627630
dsw 稀疏矩阵.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################