代码搜索：相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/218222/14930774
txt 插入排序法.txt
#include
void isort(int *a,int size);
void main()
{
int array[]={55,2,6,4,32,12,9,73,26,37};
int len=sizeof(array)/sizeof(int);
for(int i=0;i
www.eeworm.com/read/218222/14930808
txt 用冒泡法排序.txt
#include
void bubble(int[],int);
void main()
{
int array[]={55,2,6,4,32,12,9,73,26,37};
int len=sizeof(array)/sizeof(int);
for(int i=0;i
www.eeworm.com/read/116944/14947980
cpp 牛顿迭代法.cpp
#include "math.h"
#include "stdio.h"
double Func(double x)
{
return (x-(x-cos(x))/(1+sin(x)));
}
void main()
{
double x,t,eps;
x=1;
eps=0.001;
do{
t=x;
x=Func(t);
}while(fa
www.eeworm.com/read/217828/14950396
plg 牛顿迭代法.plg
Build Log
--------------------Configuration: 牛顿迭代法 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\ADMINI~
www.eeworm.com/read/217828/14950399
cpp 牛顿迭代法.cpp
# include
# include
double f (double x)
{
double x1=exp(x)*x-1;
return x1;
}
double f1 (double x1)
{
double n=exp(x1)+x1*exp(x1);
return n;
}
void main ()
{
do
www.eeworm.com/read/217828/14950403
dsw 牛顿迭代法.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/217828/14950407
dsp 牛顿迭代法.dsp
# Microsoft Developer Studio Project File - Name="牛顿迭代法" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Con
www.eeworm.com/read/217828/14950408
opt 牛顿迭代法.opt
www.eeworm.com/read/217828/14950410
ncb 牛顿迭代法.ncb
www.eeworm.com/read/217657/14955464