代码搜索：相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/296725/8080111
opt 高斯消去法.opt
www.eeworm.com/read/296725/8080114
plg 高斯消去法.plg
Build Log
--------------------Configuration: 高斯消去法 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\Users\qi\AppData
www.eeworm.com/read/195741/8133028
bak 冒泡法排序.bak
clear
dime a(10)
n=10
for i=1 to 10
a(i)=int(rand()*100)
??a(i)
next
for i=1 to n-1
for j=n to i+1 step -1
if a(j)>a(j-1)
t=a(j)
a(j)=a(j-1)
a(j-1)=
www.eeworm.com/read/195741/8133088
prg 冒泡法排序.prg
clear
dime a(10)
n=10
for i=1 to 10
a(i)=int(rand()*100)
??a(i)
next
for i=1 to n-1
for j=n to i+1 step -1
if a(j)
www.eeworm.com/read/195741/8133092
fxp 冒泡法排序.fxp
www.eeworm.com/read/246604/12717137
txt 中点划线法.txt
根据直线方程：F(x, y) = ax + by + c = 0
其中, a = y0 - y1, b = x1 - x0, c = x0y1 - x1y0。
将中点代入函数得:
d = F(M) = F(xp + 1, yp + 0.5) = a(xp + 1) + b(yp + 0.5) + c
所以当d= 0时， M在直线上方
采用增量法
d>=
www.eeworm.com/read/144683/12776713
txt 乘子法.txt
#include
#include
#define L 10
void FX(int m,int n,float x[L][L],float z,float s[L][L],float x0[L][L])
{int i,j;
for(i=0;i
www.eeworm.com/read/144683/12776717
txt 乘子法.txt
#include
#include
#define L 10
void FX(int m,int n,float x[L][L],float z,float s[L][L],float x0[L][L])
{int i,j;
for(i=0;i
www.eeworm.com/read/332124/12777140
c 冒泡法改进.c
/* 冒泡法是数据排序的一种基本算法,它的基本方法是:相邻两元素进行比较,如有需要则进行交换,
每完成一次循环就将最小元素排在最后(如从大到小排序),下一次循环是将其他的数进行类似操作?
如将N 个数按从大到小排序,Turbo C语言程序函数
如下: */
void sort(int a[],int n);
www.eeworm.com/read/332124/12777149