代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/145306/12736334
m hock1.m
%HJ模式搜索
%即使记录变化的量
%x0=[-3,-1,-3,-1]; %初始点
x0=[-10,0,-10,0];
n=4; %参数个数n
%x0=[-1.2 1.0];
%n=2;
h=1; %初始步长
a=1.618; %步长压缩因子
e=0.001;
www.eeworm.com/read/145306/12736337
m hock10.m
%2n试验搜索
%即使记录变化的量
%x0=[-3;-1;-3;-1]; %初始点
x0=[-10;0;-10;0];
n=4; %参数个数n
%x0=[-1.2;1.0];
%n=2;
h=1; %初始步长
a=1.618; %步长压缩因子
e=0.001;
www.eeworm.com/read/145250/12743297
tny test1.tny
true false or and not
int bool char while do
if then else repeat until
read write , ; :=
+ - * / (
) < = > = a2c 123 'EFG'
www.eeworm.com/read/145241/12743652
c ch8_3.c
#include
#define T 3
typedef struct
{ int key;
/* float info;*/
}JD;
void shellsort(JD r[],int n,int d[])
{ int i,j,k;
JD x;
k=0;
while(k
www.eeworm.com/read/145241/12743662
c ch8_5.c
#include
typedef struct
{ int key;
/* float info;*/
}JD;
void qksort(JD r[],int t,int w)
{ int i,j,k;
JD x;
if(t>=w) return;
i=t; j=w; x=r[i];
while(i
www.eeworm.com/read/145241/12743670
c ch8_10.c
#include
#define D 3
typedef struct node
{ int key;
/* float info;*/
int link;
}JD;
int radixsort(JD r[],int n)
{ int i,j,k,t,p,rd,rg,f[10],e[10];
for(i=1;i
www.eeworm.com/read/145241/12743696
c ch6_20.c
#include
#include
#define M 20
#define MAX 100
typedef struct node
{ int vex;
int length;
struct node *next;
}JD;
typedef struct tnode
{ int vexdata;
int
www.eeworm.com/read/145241/12743814
txt ch6_2.txt
void traver(TD g[],int n)
{ int i;
static int visited[M];
for(i=1;i
www.eeworm.com/read/145241/12743844
txt ch8_9.txt
void mergesort(JD r[],int n)
{ int i,s=1;
JD t[M];
while(s
www.eeworm.com/read/145241/12743856
txt ch8_10.txt
#define D 3
typedef struct node
{ int key;
float info;
int link;
}JD;
int radixsort(JD r[],int n)
{ int i,j,k,t,p,rd,rg,f[10],e[10];
for(i=1;i