代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/150072/12317857
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/150071/12317994
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/150071/12317999
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/150071/12318008
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/150071/12318016
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/338192/12320183
c ex1c.c
/*= ex1c.c =====================================================================
*
* Copyright (C) 2003, 2004 Nordic Semiconductor
*
* This file is distributed in the hope that it will be use
www.eeworm.com/read/338064/12326436
cpp hamiton.cpp
#include "stdio.h"
#include "iostream.h"
int n=5; //五个顶点
int visited[5+1]; //存储顶点的访问标志
int x[5+1]; //存储哈密顿回路上的顶点
int c[5+1][5+1];
void Hamiton();
void main()
{
//对数组c[][]赋值
c[1
www.eeworm.com/read/338036/12327216
c merge.c
#include
void Mpass(int x[],int y[],int k,int n); /*声明其为函数*/
void Msort(int x[],int y[],int n); /*声明其为函数*/
int main(void)
{
/*要排序整型数据序列*/
int a[] = {26,5,37,1,61,11,59,15,48,19
www.eeworm.com/read/337917/12333346
cpp kabu.cpp
#include
void sort(int a[],int l)
{
int i,j,temp;
for (i=0;i
www.eeworm.com/read/337844/12336918
cpp 1003_net.cpp
#include
int a, b, t;
int test(int num, int a=0, int b=0)
{
for (int i=100; i>1; i--) {
if ((num%i==0)&&(a%i==0||b%i==0)) num/=i;
if (num==1) return 1;
}
return 0;
}