代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/427573/8935777
c 15hbub.c
#include "string.h"
void hbub(p,n,k,m)
char *p[];
int k,m,n;
{ int j,i;
char *d;
if (kn-1) m=n-1;
while (k
www.eeworm.com/read/427573/8935778
c 15ckey.c
void ckey(p,n,k,m)
int n,k,m;
HEAPSORT *p[];
{ int i,l;
HEAPSORT *w;
void pcsift();
if (kn-1) m=n-1;
l=m-k+1;
for (i=l/2-1; i>=0; i--)
www.eeworm.com/read/427573/8935861
c 3rab1.c
int rab1(a,b,r)
int a,b,*r;
{ int k,l,m,i,p;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/427512/8938377
m chase.m
v=1;
dt=0.05;
x=[0 0 10 10];
y=[0 10 10 0];
for i=1:4
plot(x(i),y(i),'.'),hold on
end
d=20;
while(d>0.1)
x(5)=x(1);y(5)=y(1);
for i=1:4
d=sqrt((x(i+1)-x(i))^2+(y(i+1)-y(i
www.eeworm.com/read/186299/8946409
pl0 test.pl0
/* Test.PL0 */
Program abc;
Integer x,y,z;
Real a,b;
Procedure ab(Var m,n:Integer;t:Real);
Begin
t:=n+m;
If m>n then n:=m else t:=m;
While n
www.eeworm.com/read/383314/8956079
cpp suijishu.cpp
#include
#include
using namespace std;
main()
{ int p;int q;int i; int n;int s;
p=rand();
p=(p+200)%800;
q=(rand()+300)%900;
s=(rand()+300)%1000;
while(p)
{
for(i=2;
www.eeworm.com/read/427233/8959661
m l01p_ie.m
% the programm is with the integer 0-1 programming use inenumber method
function [x,f]=L01p_ie(c,A,b,N)
% the function is use the inenumber function
% 0-1 linear programming problem
% min f=c'
www.eeworm.com/read/383145/8968471
cpp 快速排序.cpp
#include
#include
void fastsort(int A[],int t,int w)
{
int i,j,x;
if(t>=w) return;
i=t;j=w;x=A[i];
while(i
www.eeworm.com/read/185726/8988684
pl0 test.pl0
/* Test.PL0 */
Program abc;
Integer x,y,z;
Real a,b;
Procedure ab(Var m,n:Integer;t:Real);
Begin
t:=n+m;
If m>n then n:=m else t:=m;
While n
www.eeworm.com/read/382895/8991528
todo
Here are some things which users have asked for that I haven't gotten
around to yet or haven't figured out how to implement yet.
- Percentage complete indication - DONE V3.1
Do I want to do this in