代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/223339/14644566
cpp algo0401.cpp
#include "algo0403.cpp"
int Index(SString S, SString T, int pos) { // 算法4.1
// T为非空串。若主串S中第pos个字符之后存在与T相等的子串，
// 则返回第一个这样的子串在S中的位置，否则返回0
int n,m,i;
SString sub;
if (pos > 0) {
www.eeworm.com/read/223339/14644597
cpp algo1012.cpp
void Merge (RedType SR[], RedType TR[], int i, int m, int n) {
// 算法10.12
// 将有序的SR[i..m]和SR[m+1..n]归并为有序的TR[i..n]
int j,k;
for (j=m+1, k=i; i
www.eeworm.com/read/223339/14644655
cpp algo0710.cpp
void FindArticul(ALGraph G) { // 算法7.10
// 连通图G以邻接表作存储结构，查找并输出G上全部关节点。
// 全局量count对访问计数。
int v;
struct ArcNode *p;
visited[0] = 1; // 设定邻接表上0号顶点为生成树的根
for (int i=1; i
www.eeworm.com/read/223339/14644694
cpp algo1102.cpp
void Adjust(LoserTree &ls, int s) { // 算法11.2
// 沿从叶子结点b[s]到根结点ls[0]的路径调整败者树。
int t, temp;
t = (s+k)/2; // ls[t]是b[s]的双亲结点
while (t>0) {
if (b[s].key > b[ls[t]].key) {
temp
www.eeworm.com/read/223144/14653814
cpp 8_6.cpp
//8_6
char* strcpy(char* dest, const char* src)
{
char* pdest=dest;
char* psrc=(char*)src;
while(*pdest++ = *psrc++);
return dest;
}
www.eeworm.com/read/122979/14654282
m ged.m
function y=ged(f,g)
while ~isempty(f) %删除f的前导零
if abs(f(1))
www.eeworm.com/read/122979/14654284
m gcd.m
function y=gcd(f,g)
while ~isempty(f) %删除f的前导零
if abs(f(1))
www.eeworm.com/read/223105/14658063
cpp chapter5-8.cpp
//文件名：CHAPTER5-8.cpp
#include
#include
using namespace std;
int main()
{
list coll; // list 容器 for character elements
// append elements from 'a' to 'z'
for (char c=
www.eeworm.com/read/223105/14658460
cpp chapter2-15.cpp
//文件名：CHAPTER2-15.cpp
#include
void main(int argc, char* argv[])
{
ifstream in("Sample.cpp");
while(in.get(*cout.rdbuf()));
in.ignore();
}
www.eeworm.com/read/122876/14662972
c 002.c
#include "stdio.h"
#include "conio.h"
#define NUM 500
struct nodetype
{int info,next;
};
struct nodetype node[NUM];
int p;
int creatnode() /*生成链表*/
{int i=1;
int b,n;
printf