代码搜索:while

找到约 10,000 项符合「while」的源代码

代码结果 10,000
www.eeworm.com/read/141005/13047868

cpp longgest.cpp

#include int main() { int i,j,n,tag,max; int *list,*MaxList; cout
www.eeworm.com/read/141005/13047870

cpp huchang.cpp

#include #include typedef struct { int begin; int key; int end; }Record; int partition(Record a[],int p,int r ) { int i=p, j=r+1; Record x=a[p]; while(t
www.eeworm.com/read/141004/13047947

i

折半插入排序源代码 public void sort(){ for(int i=1;i
www.eeworm.com/read/140985/13048980

c xian shi lian xi.c

#include #define uchar unsigned char #define OSC_FREQ 12000000 #define _10ms (65536-OSC_FREQ/(12000000/9970)) uchar code tab[]={0x88,0xEB,0x4c,0x49,0x2B,0x19,0x18,0xCB,0x08, 0x09
www.eeworm.com/read/140976/13049278

c an jian lian xi.c

#include #include #define uchar unsigned char #define COM8255 XBYTE[0X0003] #define PA8255 XBYTE[0X0000] #define PB8255 XBYTE[0X0001] #define PC8255 XBYTE[0X0002] uchar c
www.eeworm.com/read/327978/13053077

cpp stdafx.cpp

#include "stdafx.h" #include using namespace std; //创建单链表: Lnode * creatList(int n){ Lnode *HL, *p, *s; int i = 0; HL = new Lnode; if(!HL){ cout
www.eeworm.com/read/140894/13053788

java testeof.java

//: c12:TestEOF.java // Testing for end of file while reading a byte at a time. // From 'Thinking in Java, 3rd ed.' (c) Bruce Eckel 2002 // www.BruceEckel.com. See copyright notice in CopyRight.txt
www.eeworm.com/read/327871/13058736

cpp mn.cpp

#include"stdio.h" #include"stdlib.h" void main() { int i,j,m,n,l,k; int *a,*b; printf("请输入N,M:(N,M):\n"); scanf("%d,%d",&n,&m); while((m
www.eeworm.com/read/140745/13063582

inl nonlinearequation.inl

//NonLinearEquation.inl 非线性方程(组)求解函数(方法)定义 // Ver 1.0.0.0 // 版权所有(C) 何渝, 2002 // 最后修改: 2002.5.31. #ifndef _NONLINEAREQUATION_INL #define _NONLINEAREQUATION_INL //用二分法搜索方程f(x)=0在区间[a,b]内的全部实
www.eeworm.com/read/140744/13063691

inl nonlinearequation.inl

//NonLinearEquation.inl 非线性方程(组)求解函数(方法)定义 // Ver 1.0.0.0 // 版权所有(C) 何渝, 2002 // 最后修改: 2002.5.31. #ifndef _NONLINEAREQUATION_INL #define _NONLINEAREQUATION_INL //用二分法搜索方程f(x)=0在区间[a,b]内的全部实