代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/376037/9335771
f90 ex0831.f90
program ex0831
implicit none
integer :: n
write(*,*) 'N='
read(*,*) n
write(*, "(I2,'! = ',I8)" ) n, fact(n)
stop
contains
recursive integer function fact(n) result(ans)
www.eeworm.com/read/376037/9335852
f90 ex0829.f90
program ex0829
implicit none
integer :: n
integer, external :: fact
write(*,*) 'N='
read(*,*) n
write(*, "(I2,'! = ',I8)" ) n, fact(n)
stop
end
recursive integer function fac
www.eeworm.com/read/178304/9408850
m rsc_encode.m
function y = rsc_encode(g, x, terminated)
% 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
% convolutiona
www.eeworm.com/read/364310/9912624
m threshold.m
function [pfa, vt] = threshold (nfa, np)
% This function calculates the threshold value from nfa and np.
% The newton-Raphson recursive formula is used (Eq.s (2-63) through (2-66))
% This function
www.eeworm.com/read/168218/9931610
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
www.eeworm.com/read/168218/9932292
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
www.eeworm.com/read/167649/9957197
txt btreeexercises.txt
//E7
template
void B_tree::recursive_inorder(
B_node *sub_root, void (*visit)(Record &))
/*
Post: The subtree referenced by
www.eeworm.com/read/164031/10135003
m rsc_encode.m
function y = rsc_encode(g, x, terminated)
% 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
% convol
www.eeworm.com/read/358191/10194321
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
www.eeworm.com/read/356183/10235433
m threshold.m
function [pfa, vt] = threshold (nfa, np)
% This function calculates the threshold value from nfa and np.
% The newton-Raphson recursive formula is used (Eq.s (2-63) through (2-66))
% This function