代码搜索：查表法
找到约 10,000 项符合「查表法」的源代码
代码结果 10,000
www.eeworm.com/read/380114/9162097
cpp erfenfa2.cpp
//二分查找法(非递归调用)erfenfa2.cpp
#include
#include
void binsrch(int a[],int n,int x)
{int mid,top=0,bot=n-1,i,find=0,m=0;
do {
m=m+1;
mid=(top+bot)/2;
if(a[mid]==x)
www.eeworm.com/read/380114/9162189
txt xuanze4.txt
//选择排序法(函数模板)xuanze4.cpp
// 排序不改变原数组各元素的值
#include
#include
#include
#define M 10
template
void sortp(T d[],T *pd[],int b[],int size)
{int i,j,k;
fo
www.eeworm.com/read/380114/9162215
cpp maopao3.cpp
//冒泡排序法(下沉)maopao3.cpp
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j;
for(i=1;i
www.eeworm.com/read/380114/9162236
txt xuanze4f.txt
//选择排序法(函数模板、上浮)xuanze4f.cpp
#include
#include
#define M 10
template
void sortp(T d[],int size)
{int i,j,k,m;
for(i=0;i
www.eeworm.com/read/380114/9162244
cpp xuanze1.cpp
//选择排序法xuanze1.cpp
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j,k;
for(i=0;i
www.eeworm.com/read/380114/9162247
txt xuanze1.txt
//选择排序法xuanze1.cpp
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j,k;
for(i=0;i
www.eeworm.com/read/380114/9162259
cpp xuanze4.cpp
//选择排序法(函数模板)xuanze4.cpp
// 排序不改变原数组各元素的值
#include
#include
#include
#define M 10
template
void sortp(T d[],T *pd[],int b[],int size)
{int i,j,k;
fo
www.eeworm.com/read/380114/9162261
txt maopao3.txt
//冒泡排序法(下沉)maopao3.cpp
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j;
for(i=1;i
www.eeworm.com/read/380114/9162271
cpp jinbiaosai.cpp
//锦标赛排序法JinBiaoSai.cpp
#include
#include
#include
class DataNode //胜者树结点的类定义
{public:
int data;//数据值
int index;//树中的结点号
int active;//参选标志
};
//锦标赛排序中的调整算
www.eeworm.com/read/380114/9162336
txt jinbiaosai.txt
//锦标赛排序法JinBiaoSai.cpp
#include
#include
#include
class DataNode //胜者树结点的类定义
{public:
int data;//数据值
int index;//树中的结点号
int active;//参选标志
};
//锦标赛排序中的调整算