代码搜索:while

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

代码结果 10,000
www.eeworm.com/read/242043/13097621

cpp creatheap.cpp

void CreatHeap (elemtype x[], int n, int h) /*对以x[h]为根结点的,x[h+1]--x[n-1]为根结点的二叉树已是堆的*/ /*二叉树建堆。堆顶元素为最大元素*/ { int i,j,flag; elemtype Temp; i=h; j=2*i+1; /* j为i的左孩子的序号*/
www.eeworm.com/read/242043/13097657

h mergesort.h

void Merge(DataType a[], int n, DataType swap[], int k) //k为有序子数组的长度,一次二路归并排序后的有序子序列存于数组swap中 { int m = 0, u1,l2,i,j,u2; int l1 = 0; //第一个有序子数组下界为0 while(l1+k
www.eeworm.com/read/242043/13097664

h seqsearch.h

int SeqSeach(DataType a[], int n, KeyType key) //在a[0]--a[n-1]中顺序查找关键码为key的对象 //查找成功时返回该对象的下标序号;失败时返回-1 { int i = 0; while(i < n && a[i].key != key) i++; if(a[i].key == key) return i; els
www.eeworm.com/read/242043/13097736

cpp mergesort.cpp

#include #include "datatype.h" void Merge(datatype a[], int n, datatype swap[], int k) //对有序表a[0]--a[n-1]进行一次二路归并排序,每个有序子表的长度为k //一次二路归并排序后新的有序子表存于swap中 { int m = 0, u1,l2,i,j,u2
www.eeworm.com/read/242043/13097988

h orderseqsearch.h

int OrderSeqSearch(DataType a[], int n, KeyType key) //在a[0]--a[n-1]中顺序查找关键码为key的数据元素 //查找成功时返回该元素的下标序号;失败时返回-1 { int i = 0; while(i < n && a[i].key < key) i++; if(a[i].key == key) return i
www.eeworm.com/read/242043/13097996

h seqsearch.h

int SeqSearch(DataType a[], int n, KeyType key) //在a[0]--a[n-1]中顺序查找关键码为key的对象 //查找成功时返回该对象的下标序号;失败时返回-1 { int i = 0; while(i < n && a[i].key != key) i++; if(a[i].key == key) return i; el
www.eeworm.com/read/327101/13098936

cpp nbtheory.cpp

// nbtheory.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "nbtheory.h" #include "modarith.h" #include #include NAMESPACE_BEGIN(Crypto
www.eeworm.com/read/242013/13100260

dwtst

#!/bin/sh set -e runs=0 while [ 1 ]; do runs=$(($runs +1)) echo "Run $runs @`date`" ./doublewrite $1 $2 $3 ./chkdwfile $1 if [ $? -ne 0 ]; then exit 1 fi done
www.eeworm.com/read/327070/13100781

c gjpath.c

void criticalpath(aoelgrath dig,int n) { int i,j,k,m,front,rear; int ve[mvnum],vl[mvnum],e[mvnum],l[mvnum]; int tpord[mvnum]; edgenode *p; for(i=1;i
www.eeworm.com/read/140166/13101178

c otccn.c

/* Obfuscated Tiny C Compiler Copyright (C) 2001-2003 Fabrice Bellard This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable