代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/161587/10395320
cpp rcmult.cpp
// recursive dynamic programming matrix multiplication chains
// avoid recomputations
#include
#include "make2db.h"
int r[7] = {0, 10, 5, 1, 10, 2, 10};
int **kay, **c;
int C(
www.eeworm.com/read/279234/10453720
pl fig06_14.pl
#!/usr/bin/perl
# Fig 6.14: fig06_14.pl
# Recursive fibonacci function.
@sampleValues = (0, 1, 2, 3, 4, 5, 6, 10, 20, 30, 35);
# Calculate and print the fibonacci value of all the above values
www.eeworm.com/read/349937/10780598
cpp rmult.cpp
// dynamic programming recursive matrix multiplication chains
#include "stdafx.h"
#include
#include "make2db.h"
using namespace std;
int r[7] = {0, 10, 5, 1, 10, 2, 10};
int **kay;
www.eeworm.com/read/330173/12908291
m rsc_encode.m
function y = rsc_encode(g, x, l)
% Copyright Nov. 1998 Yufei Wu
% MPRG lab, Virginia Tech.
% for academic use only
% encodes a block of data x (0/1)with a recursive systematic
% convolutional code wi
www.eeworm.com/read/243623/12931334
m poly2c.m
function poly2
% poly2 forms a recursive fifth order polyphase filter and examines a number of its properties
clg;
a0=input(' enter a0 coefficient of path 0 (eg 0.164 or .190) > ') ;
a1=input('
www.eeworm.com/read/307616/13719275
cpp ex5_14.cpp
// Ex5_14.cpp (based on Ex5_01.cpp)
// A recursive version of x to the power n
#include
using std::cout;
using std::endl;
double power(double x, int n); // Function prototype
i
www.eeworm.com/read/147682/5728133
m asptsovrls.m
% [w,y,e,R,xb]=asptsovrls(xn,xb,w,d,R,a,L1,L2)
%
% Performs filtering and coefficient update using the
% Second Order Volterra Recursive Least Squares (RLS)
% adaptive algorithm.
%
% I
www.eeworm.com/read/131315/5939414
fns emacs.fns
\initial {A}
\entry {\code {abbrev-mode}}{177, 217}
\entry {\code {abbrev-prefix-mark}}{179}
\entry {\code {abort-recursive-edit}}{207, 237}
\entry {\code {add-change-log-entry}}{154}
\entry {\code {a
www.eeworm.com/read/157453/11704511
cpp rcvbits.cpp
// dynamic programming recursive computation for image
// compression avoiding recomputations
#include
int L = 256, header = 11;
int s[6] = {0,0,0,0,0,0}, kay[6];
int l[6] = {0,
www.eeworm.com/read/157453/11704615
cpp rcmult.cpp
// recursive dynamic programming matrix multiplication chains
// avoid recomputations
#include
#include "make2db.h"
int r[7] = {0, 10, 5, 1, 10, 2, 10};
int **kay, **c;
int C(