代码搜索：相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/383218/8960405
bmp 11 追赶法.bmp
www.eeworm.com/read/383218/8960414
cpp 梯形法积分.cpp
#include
#include
float A,B;
float y(float x)
{return A*x*x+B;}
void main()
{float a,b,x,h,sum,trapz;
int i,n;
printf("请输入抛物线y=Ax(2)+B的系数A,B:");
scanf("%f%f",&A,&B);
pri
www.eeworm.com/read/185347/9042206
cpp 共轭梯度法.cpp
#include"stdio.h"
#include
#include
#define MAXLENGTH 10
//向量定义
typedef struct{
int tag; //行列向量标志。行向量为0，列向量为1。
int dimension;
www.eeworm.com/read/381765/9072397
cpp 梯形法积分.cpp
#include
#include
float A,B;
float y(float x)
{return A*x*x+B;}
void main()
{float a,b,x,h,sum,trapz;
int i,n;
printf("请输入抛物线y=Ax(2)+B的系数A,B:");
scanf("%f%f",&A,&B);
pri
www.eeworm.com/read/381297/9099223
逐行扫描法
www.eeworm.com/read/183927/9130138
frm 插值法.frm
VERSION 5.00
Begin VB.Form 插值法
BackColor = &H00FF8080&
Caption = "Form1"
ClientHeight = 9255
ClientLeft = 45
ClientTop = 330
ClientWidth
www.eeworm.com/read/377037/9296996
cpp 梯形法积分.cpp
#include
#include
float A,B;
float y(float x)
{return A*x*x+B;}
void main()
{float a,b,x,h,sum,trapz;
int i,n;
printf("请输入抛物线y=Ax(2)+B的系数A,B:");
scanf("%f%f",&A,&B);
pri
www.eeworm.com/read/376627/9311517
c 冒泡法改进.c
/* 冒泡法是数据排序的一种基本算法,它的基本方法是:相邻两元素进行比较,如有需要则进行交换,
每完成一次循环就将最小元素排在最后(如从大到小排序),下一次循环是将其他的数进行类似操作?
如将N 个数按从大到小排序,Turbo C语言程序函数
如下: */
void sort(int a[],int n);
www.eeworm.com/read/376627/9311524
c 穷举搜索法.c
www.eeworm.com/read/376627/9311528