代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/158865/5592875
c rewind.c
#include "f2c.h"
#include "fio.h"
#ifdef KR_headers
integer f_rew(a) alist *a;
#else
integer f_rew(alist *a)
#endif
{
unit *b;
if (f__init & 2)
f__fatal (131, "I/O recursion");
if(a->aunit>=MXUNI
www.eeworm.com/read/290864/8457956
m random_centerqqq.m
function random_centerqqq(Z,N);
% 三角形中点位移法分形曲面生成[法向交叉、劈裂]
% Z is the position of three points.
% N is the times of recursion.
% Example:
% random_centerqqq([0,6,3+4i],4);
% Author's emai
www.eeworm.com/read/168118/9938333
m rcs2imp_r.m
function imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot)
%
% RCS2IMP_R computes impedence from RCS by recursion. It is
% more accurate but slower than RCS2IMP
%
www.eeworm.com/read/455463/1614541
m rcs2imp_r.m
function imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot)
%
% RCS2IMP_R computes impedence from RCS by recursion. It is
% more accurate but slower than RCS2IMP
%
www.eeworm.com/read/194440/8194597
m rcs2imp_r.m
function imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot)
%
% RCS2IMP_R computes impedence from RCS by recursion. It is
% more accurate but slower than RCS2IMP
%
www.eeworm.com/read/235612/14061348
m rcs2imp_r.m
function imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot,flag)
% imp=rcs2imp_r(rcs,znot)
%
% RCS2IMP_R computes impedence from RCS by recursion. It is
% more accurate but slower than RCS2IMP
%
www.eeworm.com/read/362213/10012444
m ex2_5.m
% Example 2.5
%
a = [-1 -2]; b = [0 0 0];
n = 2:10;
x = zeros(1,length(n)); % creates a zero vector
x0 = [0 0]; y0 = [1 3];
y1 = recur(a,b,n,x,x0,y0); % solution via recursion
y2 = (4*(2).
www.eeworm.com/read/174714/9575905
ica sorta.ica
[D2sD3s]:Dld [ input m n, output m n m n ]ld
[2*1=d]:cld [ aux routine for :d recursion ]ld
[1=D1s>1Ds_+=c]:dld [ input m n, as long as n