代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/459616/7270343
cpp dmult.cpp
// dynamic programming matrix multiplication chain
// non-recursive solution
#include
#include "make2db.h"
void MatrixChain(int r[], int q, int **c, int **kay)
{// Compute costs and kay
www.eeworm.com/read/445965/7587117
h response.h
#ifndef _RESPONSE_H
#define _RESPONSE_H
#include
#include
#include
#include
#include
#include
www.eeworm.com/read/445965/7587128
h stock.h
#ifndef _TDX_STOCK_H_
#define _TDX_STOCK_H_
#include
#include
#include
#include
#include
www.eeworm.com/read/299384/7863951
h binarytree.h
using namespace std;
const int MAX_BINARYTREE_SIZE=100;
enum Inorder{RECURSIVEINORDER,NONRECURSIVEINORDER};//recursive inorder中序递归遍历,nonrecursive inorder中序非递归遍历
template
class Binary
www.eeworm.com/read/197407/7997772
h select2.h
// find the k'th smallest element
// no recursive calls
#ifndef Select_
#define Select_
#include "xcept.h"
#include "swap.h"
template
T Select(T a[], int n, int k)
{// Return
www.eeworm.com/read/140767/13062511
m rsc_encode.m
function y = rsc_encode(g, x, end)
% 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
www.eeworm.com/read/303905/13806547
cpp fib.cpp
#include
#include
#include "book.h"
long fibr(int n) { // Recursive Fibonacci generator
Assert((n>0) && (n
www.eeworm.com/read/147682/5728088
m asptsharf.m
% [w,u,y,e,Px,Py] = asptsharf(N,M,w,u,x,d,e,c,mu,Px,Py)
%
% Performs filtering and coefficient update using the
% Simple Hyperstable Adaptive Recursive Filter (SHARF)
% algorithm. The f
www.eeworm.com/read/147682/5728127
m asptouterr.m
% [u,w,c,y,e,Px,Py]=asptouterr(N,M,u,w,c,x,d,mu,Px,Py)
%
% Performs filtering and coefficient update using the
% Output Error Adaptive Recursive Filter
% algorithm. The filter transfer
www.eeworm.com/read/136989/5827625
cpp test_t.cpp
// Test_T.cpp,v 1.5 2000/03/19 20:09:32 jcej Exp
/* This is something new... Since we're included by the header, we
have to provide a sentry to protect against recursive inclusion.
*/
#ifnde