代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/345930/11781662
cpp xt6-16.cpp
#include
using namespace std;
int main()
{char str[50],*pstr;
int i,j,k,m,e10,digit,ndigit,a[10],*pa;
cout
www.eeworm.com/read/345926/11782067
cpp vc0202.cpp
//example 2-2
#include
#define M 10001
void CreatePrimeList(int PrimeList[])
{
int i,j;
for(i=0;i
www.eeworm.com/read/259465/11788660
c 44blib.c
#include "..\inc\44b.h"
#include "..\inc\44blib.h"
#include "..\inc\def.h"
#include "..\inc\option.h"
#include
#include
#include
#include
#include
www.eeworm.com/read/345808/11790651
lst main.lst
C51 COMPILER V8.02 MAIN 03/31/2008 20:06:45 PAGE 1
C51 COMPILER V8.02, COMPILATION OF MODULE MAIN
OBJECT MODULE PLACED IN .\
www.eeworm.com/read/345676/11795405
m router.m
%配合floyd算法的后续程序,s为源点,t为宿点
%L为长度,R为路由
function [L,R]=router(D,path,s,t)
L=zeros(0,0);
R=s;
while 1
if s==t
L=fliplr(L);
L=[0,L];
return
end
L=[L,D(s,t)];
www.eeworm.com/read/156458/11802324
cpp qcksrt.cpp
void qcksrt(int n, double arr[])
{
int m = 7; int nstack = 50; int fm = 7875; int fa = 211;
int fc = 1663; double a,fmi = 0.00012698413;
int istack[51];
int jstack = 0;
int i,j,
www.eeworm.com/read/156458/11802330
cpp sort2.cpp
void sort2(int n, double ra[], double rb[])
{
int l,ir,i,j;
double rra,rrb;
l = n / 2 + 1;
ir = n;
do
{
if (l > 1)
{
l = l - 1;
rra = ra[l];
www.eeworm.com/read/156458/11802340
cpp indexx.cpp
void indexx(int n, double arrin[], int indx[])
{
int i,j,l,ir,indxt;
double q;
for (j = 1; j
www.eeworm.com/read/156458/11802350
cpp sort.cpp
void sort(int n, double ra[])
{
int i,j,l,ir;
double rra;
l = int(n / 2) + 1;
ir = n;
do
{
if (l > 1)
{
l = l - 1;
rra = ra[l];
}
www.eeworm.com/read/259300/11808921
c 2440lib.c
//===================================================================
// File Name : 2440lib.c
// Function : S3C2440 PLL,Uart, LED, Port Init
// Date : March 20, 2002
// Version : 0.0
//