代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/493843/6391511
m gtoa.m
function a=gtoa(gamma)
%GTOA Step-up recursion
%----
%USAGE a = gtoa(gamma)
%
% The direct-form filter coefficients
% a=[1 a(1) ... a(p)]
% are derived from the reflection coefficients gamma
www.eeworm.com/read/264397/11316583
cpp bag_stack.cpp
#include
////////////////////////////////////////////////////////////////////////////////
//用栈实现
int n;//number of items
int*item;//pointer to the items' array
int t;//total capabilit
www.eeworm.com/read/403373/11518453
m cantor3.m
function Cantor3(n);
% n is the number of recursion
%
% \copyright:zjliu
% Author's email: zjliu2001@163.com
if nargin==0;
n=5;
end
hold on;
[x,L]=ccp(0,0.5,n,0);
axis off;
function [x
www.eeworm.com/read/261074/11667540
m bess.m
function jj = bess(m_max,x)
% Bessel function
% Inputs
% m_max = Largest desired order
% x = Value at which Bessel function J(x) is evaluated
% Output
% jj = Vector of J(x) for all orde
www.eeworm.com/read/162614/5530916
c recurse-3.c
/* Tests that macros that look recursive but are not are accepted. */
/* { dg-do preprocess } */
#define g(x) x
g(g(g(g(g(g(g)))))); /* { dg-bogus "detected recursion" } */
/* This macro ge
www.eeworm.com/read/276944/10692895
m classify_slow.m
function [ar_mode] = classify2(I)
% Tree Traversal
ar_path = zeros(size(I));
ar_mode = zeros(size(I));
%for each point
for i=1:size(I,2)
[ar_mode(i),ar_path] = findMode(I(i),I,ar_path
www.eeworm.com/read/276944/10692914
m classify.m
function [ar_mode] = classify2(I)
% Tree Traversal
ar_path = zeros(size(I));
ar_mode = zeros(size(I));
%for each point
for i=1:size(I,2)
[ar_mode(i),ar_path] = findMode(I(i),I,ar_path
www.eeworm.com/read/264397/11316634
cpp bag_layout.cpp
#include
////////////////////////////////////////////////////////////////////////////////
//用动态规划来实现
//假设n
www.eeworm.com/read/162614/5518908
c recurse.c
// Test for handling of excessive template recursion.
// { dg-options "-ftemplate-depth-50 -O" }
template struct F
{
int operator()()
{
F f; // { dg-error "" "" }
ret
www.eeworm.com/read/162614/5528306
c acc1.c
/* { dg-options "-O2 -ffast-math" } */
/* Fast maths allows tail recursion to be turned into iteration. */
double
foo (int n, double f)
{
if (n == 0)
return f;
else
return f + foo (n -