代码搜索：查表法
找到约 10,000 项符合「查表法」的源代码
代码结果 10,000
www.eeworm.com/read/421634/10723301
cpp 例2_7.cpp
//两个升序链表合并
#include
struct link
{ int data; //元素类型
link *next; //指针类型,存放下一个元素地址
};
link *rcreat( )//尾插法建立链表
{
link *s,*r,*p;
int i;
p=r=new link;
p->ne
www.eeworm.com/read/420254/10808438
m test_my_ode.m
function test_my_ode
% 以一步Euler法说明MATLAB/ODEs的实现及封装方法
% $sunshengli@sohu.com $
% $Date: 2005/07/20 $
h = 0.1;
t = 0:0.1:20;
y0 = -4;
% [t,y] = ode45(@odefun,t,y0); % 使用Ma
www.eeworm.com/read/419864/10833189
htm 003.htm
【中英對照】The Master Key System 24週財富金鑰系統Week 3_吸引力法則 Law of Attraction
.error{co
www.eeworm.com/read/419861/10833548
htm 001.htm
【中英對照】The Master Key System 24週財富金鑰系統Week 1_吸引力法則 Law of Attraction
.error{c
www.eeworm.com/read/275035/10838495
c thrice.c
/* 用弦截法求解方程的根 */
# include
# include
float f(float x)
{
float y;
y = ((x-8.0)*x+12.0)*x - 30.0;
return y;
}
float xpoint(float x1, float x2) /* 定义函数xpoint，求出弦
www.eeworm.com/read/274170/10886384
c thrice.c
/* 用弦截法求解方程的根 */
# include
# include
float f(float x)
{
float y;
y = ((x-8.0)*x+12.0)*x - 30.0;
return y;
}
float xpoint(float x1, float x2) /* 定义函数xpoint，求出弦
www.eeworm.com/read/271354/10999735
m simplex.m
function [val, X, exitFlag] = simplex(A, b, B, c)
%function [val, X, exitFlag] = simplex(A, b, B, c)
% simplex.m
% 单纯形法求解线性规划
% 函数输入各项为标准型对应值
% val 最优解的值
% X 最优解 1*n
% exitFlag
www.eeworm.com/read/469046/6984292
m 15-3.m
I = imread('rice.tif');
BW = edge(I,'canny');
% 以自动阈值选择法对图像进行Canny算子检测
[BW,thresh] = edge(I,'canny');
% 返回当前Canny算子边缘检测的阈值
disp('Canny算子自动选择的阈值为：')
disp(thresh)
subplot(121),imshow(BW);
title(
www.eeworm.com/read/140741/7069842
cpp le_tridiagonalequationgauss.cpp
//LE_TridiagonalEquationGauss.cpp 求解三对角线方程组的追赶法
#include //输入输出流头文件
#include "LinearEquation.h" //线性方程(组)求解头文件
void main()
{
int i;
double b[13] =
{
13.0, 12.
www.eeworm.com/read/463853/7174623
m untitled.m
%==============平移对应法==============
%==============基于Logistic映射==============
clear;
q=8;%频隙数
L=60;
N=L*q;
d=10;%跳频间隔
x0(1)=0.35;
for i=2:N
x0(i)=4*x0(i-1)*(1-x0(i-1));
end
%==============