代码搜索：相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/285104/8869657
c 堆积法heapsort.c
www.eeworm.com/read/285104/8869662
c shell法shell.c
www.eeworm.com/read/285104/8869676
c 桶子法bucket.c
www.eeworm.com/read/428233/8881953
cpp 牛顿迭代法.cpp
#include
#include
#define N 100
#define EPS 1e-6
#define ETA 1e-8
void main()
{
float f(float);
float f1(float);
float x0,y0;
float Newton(float (*)(float),float (*
www.eeworm.com/read/428233/8881969
cpp 改进欧拉法.cpp
#include
#define N 20
void ModEuler(float (*f1)(float,float),float x0,float y0,float xn,int n)
{
int i;
float yp,yc,x=x0,y=y0,h=(xn-x0)/n;
cout
www.eeworm.com/read/284929/8882655
cpp 筛选法求素数.cpp
#include
#include //筛选法求素数
void sushu(void)
{
int a[101],i,j;
a[1]=0;
for(i=2; i
www.eeworm.com/read/383143/8970484
plg 马的走法.plg
Build Log
--------------------Configuration: 马的走法 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\raojun\L
www.eeworm.com/read/382100/9049643
obj 筛法筛素数.obj
www.eeworm.com/read/382100/9049646
cpp 筛法筛素数.cpp
#include
#include
using namespace std;
const int n=1000;
int main()
{
int i;
int d=2;
int j=0;
int a[n+1];
for (i=2;i
www.eeworm.com/read/381297/9099229
c 逐行扫描法.c
#include
unsigned int A[16]={0x77,0x7b,0x7d,0x7e,0xb7,0xbb,0xbd,0xbe,0xd7,0xdb,0xdd,0xde,0xe7,0xeb,0xed,0xee};
void main(void)
{
unsigned int B[4]={0x7f,0xbf,0xdf,0xef};
unsigned