代码搜索：查表法
找到约 10,000 项符合「查表法」的源代码
代码结果 10,000
www.eeworm.com/read/436437/7770011
txt san.zip.txt
/*跨孔条件下，井中10m供电二极剖面法球体程序（球体中心（坐标原点）在两井中心的左侧）*/
#include
#include
double P(int N, double X)
{
if(N == 0)
return 1;
else
if(N== 1)
retur
www.eeworm.com/read/435844/7782849
m exm062_8.m
%exm062_8.m
clear
clf;
dx=0.1;
x=0:dx:4;
y=x.*sin(x);
s=cumtrapz(y)*dx; %梯形法求累计积分
plotyy(x,y,x,s),
text(0.5,0,'\fontsize{14}\ity=xsinx')
sint='{\fontsize{16}\int_{\fontsize{8}0}^{ x}}';
t
www.eeworm.com/read/299504/7846643
h 51t9py_indexa.h
typedef struct t9PY_index
{
char *T9;
char *py;
char *hz_table;
} T9INFO;
/*"拼音输入法查询码表,T9数字字母索引表(index)"*/
T9INFO T9InfoTable[] = {
{ "", "", PY_mb_space },
// a
{ "2",
www.eeworm.com/read/299227/7873525
cpp xuanze5.cpp
//选择排序法xuanze5.cpp
//排序后不改变原数组各元素的值
#include
#include
#include
#include
#define M 10
void sortp(int d[],int *pd[],int b[],int size)
{int i,j,k;
for(i
www.eeworm.com/read/299227/7873570
cpp maopao3.cpp
//冒泡排序法(下沉)maopao3.cpp
#include
#include
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j;
for(i=1;i
www.eeworm.com/read/299227/7873686
cpp xuanze2.cpp
//选择排序法(下沉)xuanze2.cpp
#include
#include
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j,k;
for(i=1;i
www.eeworm.com/read/299227/7873694
cpp xuanze1.cpp
//选择排序法xuanze1.cpp
#include
#include
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j,k;
for(i=0;i
www.eeworm.com/read/299227/7873721
cpp xuanze4.cpp
//选择排序法(函数模板)xuanze4.cpp
// 排序不改变原数组各元素的值
#include
#include
#include
#include
#include
#define M 10
template
void sortp(T d[],T *pd
www.eeworm.com/read/299227/7874449
h tree.h
//树的孩子兄弟表示法为存储结构的结构体Tree.h
template class Tree;
template struct TreeNode
{friend class Tree;//树类为友元
private:
TreeNode *firstChild;//第一个孩子结点指针域
TreeNode *nextSibli
www.eeworm.com/read/299227/7875130
cpp erfenfa1.cpp
//二分查找法(递归调用)erfenfa1.cpp
#include
#include
#include
double a[10]={1.1,1.3,1.5,1.7,1.9,2.1,2.3,2.5,2.7,2.9};
void binsrch(int s,int r,double x)
{int m;
m=(s+r)