代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/155145/11894881
m ste.m
function [sigma,e,tr,tp,ts]=ste(y,t)
[mp,tf]=max(y);
cs=length(t);
yss=y(cs);
sigma=(mp-yss)/yss; %计算超调量
k=1; %计算误差函数
for k=1:cs
e(k)=y(k)-yss;
end
tp=t(tf); %峰值时间
m=1;k
www.eeworm.com/read/344239/11896378
java listiteration.java
//: holding/ListIteration.java
import typeinfo.pets.*;
import java.util.*;
public class ListIteration {
public static void main(String[] args) {
List pets = Pets.arrayList(8);
L
www.eeworm.com/read/257992/11897122
c default.c
#include "stdafx.h"
#include "Default.h"
void delay(uint dly)
{
while(1){
dly--;
if(dly
www.eeworm.com/read/257980/11897839
c bo4-3.c
/* bo4-3.c 串采用块链存储结构(由c4-3.h定义)的基本操作(16个) */
void InitString(LString *T)
{ /* 初始化(产生空串)字符串T。另加 */
(*T).curlen=0;
(*T).head=NULL;
(*T).tail=NULL;
}
Status StrAssign(LString *T,ch
www.eeworm.com/read/257591/11919993
cpp yemianzhihuan.cpp
/*给出FIFO、LRU、OPT算法及其缺页,中断率*/
/*如果输入的页面号大于输入的实际页数，程序不予运行*/
#include
#define M 40
int N;
struct Pro
{
int num,time;
};
int Input(int m,Pro p[M])
{
cout
www.eeworm.com/read/257588/11920140
m ex3_11.m
sum=0;
cnt=0;
val=input('Enter a number (end in 0):');
while (val~=0)
sum=sum+val;
cnt=cnt+1;
val=input('Enter a number (end in 0):');
end
if (cnt > 0)
sum
mean=sum/cn
www.eeworm.com/read/257586/11920238
c sort.c
#include
#include "math.h"
void swap(int *a,int *b)
{
int c = *a;
*a = *b;
*b = c;
}
//简单选择排序
void SelectSort(int r[],int n)
{
int i,j,k,t;
for (i=0;i
www.eeworm.com/read/154878/11921327
lua sort.lua
-- two implementations of a sort function
-- this is an example only. Lua has now a built-in function "sort"
-- extracted from Programming Pearls, page 110
function qsort(x,l,u,f)
if l
www.eeworm.com/read/343774/11928207
c dco_2mhz_20xx.c
//******************************************************************************
// MSP430x20x2 Demo - Basic Clock, Output Buffered SMCLK, ACLK and MCLK/10
//
// Description: Buffer ACLK on P2.0,