代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/143612/12856460
c selsort.c
//直接选择排序算法
#define MAX 10 //元素的最大个数
int R[MAX+1]={0,5,2,9,12,3,1,4} ; //有效元素序号从1到n,其中R[0]单元作为机动单元
int n; //元素的实际个数
SELECTSORT ( ) //直接选择排序算法
{ int i,j,k; //定义辅助变量
for (i=1;i
www.eeworm.com/read/244517/12858776
c test5.c
int main(int argc, char **argv)
{
int i = 0;
int sum = 0;
while(i < 10) {
sum += i;
i++;
}
return 0;
}
www.eeworm.com/read/330946/12860153
m zcx.m
clear;
nn=20;%设置随机方向数
x0=[3;2];
xx=x0;
f0=getf(x0);
ii=0;
while ii
www.eeworm.com/read/330928/12860681
m deci22bin.m
%deci22bin.m
function y=deci22bin(x,t)
%十进制数x转化为二进制数，二进制数至少表示为t位
y=zeros(size(x,1),t);
for j=1:size(x,1)
i=1;
while x(j)>=0&i
www.eeworm.com/read/330846/12865442
txt instfreq.m.txt
function [fnormhat,t]=instfreq(x,t,L,trace);
%INSTFREQ Instantaneous frequency estimation.
% [FNORMHAT,T]=INSTFREQ(X,T,L,TRACE) computes the instantaneous
% frequency of the analytic signal X at time
www.eeworm.com/read/330777/12869648
m maink.m
function f=maink()
s=input('输入向量：');
%P=sum(s);
%if P~=1
% disp('没有归一');
% maink();
%else
L=length(s);
R=-100.*ones(L,L);
if L==1
R=1;
else
k=seleij(s);
i=k(1);
j=k(2);
m=0;
www.eeworm.com/read/330756/12870122
m newton.m
function s=Newton(x,y,x0,nn)
nx=length(x);
ny=length(y);
if nx~=ny
warning('向量x与y的长度应该相同');
return;
end
m=length(x0);
%according to formula,calculate x0 that will get
for i=1:m
t
www.eeworm.com/read/143461/12873575
cpp comb1.cpp
#include
#include
void comb(int n,int k,int *a)
{
int *s=new int[k+1],tp=k;
for(int i=0;i