代码搜索：JS

找到约 10,000 项符合「JS」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/290204/8496992

c rinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int rinv(n,a) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mallo
·
www.eeworm.com/read/290204/8497015

c rjordn.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int rjordn(n,a,m,b) int n,m; double a[],b[]; { int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int));
·
www.eeworm.com/read/432144/8623783

c 6.2 求解实系数方程组的全选主元高斯-约当消去法 gjdn.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int gjdn(a,b,n,m) int n,m; double a[],b[]; { int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int)); l=1; for(k=0;k
·
www.eeworm.com/read/432144/8623829

c 6.9 求解大型稀疏方程组 ggje.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int ggje(a,n,b) int n; double a[],b[]; { int *js,i,j,k,is,u,v; double d,t; js=malloc(n*sizeof(int)); for (k=0; k
·
www.eeworm.com/read/432144/8623875

c 6.1 求解实系数方程组的全选主元高斯消去法 gaus.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int gaus(a,b,n) int n; double a[],b[]; { int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int)); l=1; for (k=0;k
·
www.eeworm.com/read/432144/8624416

c 4.3 一般实矩阵求逆 rinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int rinv(a,n) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=malloc(n*sizeof(
·
www.eeworm.com/read/432144/8624422

c 4.8 求矩阵的秩 rank.c

#include "math.h" int rank(a,m,n) int m,n; double a[]; { int i,j,k,nn,is,js,l,ll,u,v; double q,d; nn=m; if (m>=n) nn=n; k=0; for (l=0; l
·
www.eeworm.com/read/432144/8624439

c 4.7 求一般行列式的值 sdet.c

#include "math.h" double sdet(a,n) int n; double a[]; { int i,j,k,is,js,l,u,v; double f,det,q,d; f=1.0; det=1.0; for (k=0; k
·
www.eeworm.com/read/432144/8624482

c 4.4 一般复矩阵求逆 cinv.c

#include "stdlib.h" #include "stdio.h" int cinv(ar,ai,n) int n; double ar[],ai[]; { int *is,*js,i,j,k,l,u,v,w; double p,q,s,t,d,b; is=malloc(n*sizeof(int)); js=malloc(n*sizeof
·
www.eeworm.com/read/431721/8658784

c 6gaus.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int gaus(a,b,n) int n; double a[],b[]; { int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int)); l=1
·