代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/250634/12395345
m sor.m
%Successive Over Relaxation迭代程序
function [x,sp]=sor(a,b,n,x1,w)
%误差
e=ones(n,1);
%迭代的解向量
x2=zeros(n,1);
%迭代的次数
k=0;
%当误差没有满足要求时继续迭代
while norm(e,2)>1e-6
%每隔5步显示迭代结果
if (rem(k,5)==0)
www.eeworm.com/read/250634/12395369
m jac.m
%Jacobian迭代程序
function [x,sp]=jac(a,b,n,x1)
%误差
e=ones(n,1);
%迭代的解向量
x2=zeros(n,1);
%迭代的次数
k=0;
%当误差没有满足要求时继续迭代
while norm(e,2)>1e-6
%每隔5步显示迭代结果
if (rem(k,5)==0)
str=sprintf('X
www.eeworm.com/read/250634/12395406
m biology.m
clear;
n=10000;
x=zeros(n,1);
x(1)=0.1;
i=1;
while i
www.eeworm.com/read/149189/12396123
c lexyy.c
/*--------------------------------------------------------*/
/* Copyright (c) PSW-soft 1996 */
/* */
/* File: LEXY
www.eeworm.com/read/250534/12400318
cpp 6-7-2.cpp
#include
void InsertSort(int slist[], int n)
{ int temp;
int i,j;
for (i=1; i < n; i++) {
temp = slist[i];
j=i;
while (j>0 && temp < sli
www.eeworm.com/read/250534/12400430
cpp result.cpp
1：#include
2：const int N=10;
3：
4：void display(int a[], int n)
5：{ for(int i = 0; i < n; i ++) cout
www.eeworm.com/read/250534/12400564
cpp list.cpp
#include
const int N=10;
void display(int a[], int n)
{ for(int i = 0; i < n; i ++) cout
www.eeworm.com/read/336933/12406056
c 7dhrt.c
#include "math.h"
int dhrt(a,b,h,eps,x,m,f)
int m;
double a,b,h,eps,x[],(*f)();
{ int n,js;
double z,y,z1,y1,z0,y0;
n=0; z=a; y=(*f)(z);
while ((z
www.eeworm.com/read/336933/12406080
c 16hbsh.c
#include "string.h"
int hbsh(p,n,a,b,m)
int n,*m;
char a[],b[],*p[];
{ int i,j,k;
i=1; j=n;
while (i=0)&&(strcmp(p[k-1
www.eeworm.com/read/336933/12406170
c 12maxn.c
#include "math.h"
void maxn(x,n,eps,k,js,ff)
int n,k,js[];
double eps,x[],(*ff)();
{ int i,j,m,l,jt,il;
double y[10],b[10],p,z,t,h1,h2,f,dx;
js[0]=0; jt=1; h2=0.0;
while