代码搜索：查表法

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

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

cpp maopao2.cpp

//冒泡排序法(上浮)maopao2.cpp #include #include #include #include #define N 10 void gensort(int b[],int n) {int i,j; for(i=0;i
·
www.eeworm.com/read/310200/13656123

cpp erfenfa2.cpp

//二分查找法(非递归调用)erfenfa2.cpp #include #include #include void binsrch(int a[],int n,int x) {int mid,top=0,bot=n-1,find=0,m=0; do { m=m+1; mid=(top+bot)/2;
·
www.eeworm.com/read/309760/13664874

java integration.java

package numericalAnalysis.integration; import java.text.DecimalFormat; import numericalAnalysis.function.Function; /** * 积分求解,包括牛顿柯特斯公式和龙贝格法.对照书:数值分析第二版,史万明等编,北京理工大学出版社 * * @author 山 *
·
www.eeworm.com/read/307212/13726372

c j_pyime.c

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

c j_pyime.c

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

m ex6_47.m

randn('state', 1); n = 0:99; s = exp(i*pi/2*n) + 2*exp(i*pi/4*n) + exp(i*pi/3*n) + randn(1, 100); X = corrmtx(s, 7, 'mod') % 使用改进的协方差法估计互相关矩阵 [s, w, V, E] = pmusic(X, 4, 'whole'); pmusic(X, 4, '
·
www.eeworm.com/read/153991/6294065

cpp vc0306.cpp

// Example 3-6：交换排序 #include // 函数 bubble_up(): 冒泡法排序 void bubble_up(int list[], int count) { for(int i=0; ii; j=j-1) if(list[j-1]>list[j
·
www.eeworm.com/read/389070/6353170

m c5_3.m

%C5_3.m %用高斯求积法计算定积分 function C5_3 a=input('Lower limit,a?'); b=input('Upper limit,b?'); n=input('Gauss点个数：n?'); h=(b-a); xa=[]; %h=(b-a)/(n-1);x0=a+(0:(n-1))*h; t=[-0.8611363116,-0.339981043
·
www.eeworm.com/read/493388/6402117

m orderbasedxover.m

function [c1,c2]= oox(p1,p2,bounds,Ops) % Orderbased crossover takes two parents P1,P2 and performs order % based crossover by Davis.顺序交叉法 % % function [c1,c2] = orderbasedXover(p1,p2,bounds,Ops) %
·
www.eeworm.com/read/487407/6511150

cpp c.cpp

#include #include #include typedef struct data { float x; float y; }Data;//变量x和函数值y的结构 Data d[20];//最多二十组数据 float f(int s,int t)//牛顿插值法，用以返回插商 { if(t==s+1)
·