代码搜索:查表法

找到约 10,000 项符合「查表法」的源代码

代码结果 10,000
www.eeworm.com/read/130875/5950123

-

Attribute VB_Name = "modMethod" '两组判别 Option Explicit '全主元高斯-约当消去法求逆矩阵 'A(1 To m, 1 To m):开始存放欲求逆的矩阵,最终存求逆的结果矩阵,m是自变量个数 Public Sub Invert(a() As Double) Dim n As Integer, ep As Double D
www.eeworm.com/read/119338/6090767

java ex_4_2_4.java

/* *文件名:ex_4_2_4.java *说 明:一维数组应用举例 * 冒泡法排序 */ public class ex_4_2_4 { public static void main(String args[]) { int i,j; //定义并初始化数组 int intArray[]={30,1,-9,70,25,30,50,80,100
www.eeworm.com/read/222514/6283160

txt jacobi-matlab.txt

Jacobi迭代法的Matlab程序 function [x]=Jacobi_iterative(A,b) % 用Jacobi迭代求解线性方程组,矩阵A是方阵 x0=zeros(1,length(b)); % 赋初值 tol=10^(-6); % 给定误差界 N=100; % 给定最大迭代次数 [n,n]=size(A); % 确定矩阵A的阶
www.eeworm.com/read/286218/6298388

c fcm.c

//模糊聚类分析法 #include #include #include int N;//样本数 int M;//特征数 double Q//置信水平 double **DATA//样本数据 double *P//平均值矩阵 double *P1//标准差矩阵 double **DATA2 double **
www.eeworm.com/read/358107/6324248

txt xylmat.txt

%%用匈牙利法解指派问题 %%C是效益矩阵 function [y,fval,flag]=Hungary(C) [m,n]=size(C); tempC=C; %%%以下两个循环使每行每列都出现零元素 for i=1:m tempC(i,:)=tempC(i,:)-min(tempC(i,:)); end for i=1:n tempC(:,i)=tempC
www.eeworm.com/read/494076/6387642

m pdes2ds_collocation.m

function PDEs2DS_Collocation % 用对称正交配置法求解固定床反应器二维拟均相稳态模型(二维稳态PDE方程组) % (只在r方向无因次化) % % Author: HUANG Huajiang % Copyright 2003 UNILAB Research Center, % East China University of Science a
www.eeworm.com/read/492513/6415093

c pinyin.c

#include #include struct PY_index { char *PY; char *PY_mb; }; //"拼音输入法汉字排列表,码表(mb)" code char PY_mb_a[] ={"阿啊"}; code char PY_mb_ai[] ={"哎哀唉埃挨皑癌矮蔼艾爱隘碍"};
www.eeworm.com/read/484981/6569780

java sample3_6.java

public class Sample3_6 { public static void main(String[] args) { //通过枚举法创建了数组对象,列举了12个元素值。 int[] d=new int[]{1,4,6,2,3,78,21,45,79,34,113,76}; //打印数组长度 System.out.println("d.len
www.eeworm.com/read/480785/6661586

m opt11.m

% 最优化作业 第十一章 模式搜索法 % 08203-5班 王永亮 2008200383 clc; clear all; delta = 1; alpha = 1; beta = 0.25; epsilon = 0.11; k = 1; j = 1; e1 = [1 0]'; e2 = [0 1]'; % x1 = [0 0]'; %(1) beta = 0.5; x1 =
www.eeworm.com/read/480611/6666842

cpp 8.6.cpp

/*用炫截法球方程f(x)=x3-5x2+16x-80=0的根*/ #include #include //int main() float f(float x) { float y; y=((x-5.0)*x+16.0)*x-80.0; return(y); } float xpoint (float x1,float