代码搜索：查表法
找到约 10,000 项符合「查表法」的源代码
代码结果 10,000
www.eeworm.com/read/310378/13652652
cpp 牛顿下山法.cpp
#include
#include
using namespace std;
double f(double x)
{
return x*x*x-x-1;
}
double fx(double x)
{
return 3*x*x-1;
}
void m
www.eeworm.com/read/308157/13707074
c 冒泡法改进.c
/* 冒泡法是数据排序的一种基本算法,它的基本方法是:相邻两元素进行比较,如有需要则进行交换,
每完成一次循环就将最小元素排在最后(如从大到小排序),下一次循环是将其他的数进行类似操作?
如将N 个数按从大到小排序,Turbo C语言程序函数
如下: */
void sort(int a[],int n);
www.eeworm.com/read/308157/13707079
c 穷举搜索法.c
www.eeworm.com/read/308157/13707081
c 递堆法.c
www.eeworm.com/read/308157/13707158
c 各种排序法.c
#include
#include
struct node
{
int key;
}r[20];
struct rnode
{
int key;
int point;
};
main()
{
void print(struct node a[20],int n);
int creat();
void shell
www.eeworm.com/read/305066/13779328
doc 矩量法.doc
www.eeworm.com/read/304895/13783668
cpp 牛顿切线法.cpp
#include "math.h"
#include "stdio.h"
#include "iostream.h"
#define MaxK 1000
#define EPS 0.5e-3
double f(double x){return x*x*x-x-1;}
double f1(double x){return 3*x*x-1;}
void main()
{
dou
www.eeworm.com/read/304895/13783676
cpp 牛顿下山法.cpp
#include
#include
#include
#include
#define Et 1e-3 //下山因子下界
#define E1 1e-3 //根的误差限
#define E2 1e-6 //残量精度
double f(double x)
{
return x*x*x-x-1;
}
dou
www.eeworm.com/read/304331/13796466
cpp c均值法.cpp
// c均值法.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "math.h"
#include "iostream.h"
#define NUM 5
#define NN 8
#define CNUM 4
typedef struct
www.eeworm.com/read/301451/13859076