代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/409260/11339050
f90 ex0828.f90
program ex0828
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/157454/11702598
readme
LIST OF ALL C++ PROGRAMS IN CHAPTER 1
All programs have been tested using Borland C++ version 5.01 for Windows 95.
For programs that require input to be provided, sample input is given in the
www.eeworm.com/read/346512/11740071
tig test39.tig
/* This is illegal, since there are two functions with the same name
in the same (consecutive) batch of mutually recursive functions.
See also test48 */
let
function g(a:int):int = a
function
www.eeworm.com/read/346512/11740189
tig test48.tig
/* This is legal. The second function "g" simply hides the first one.
Because of the intervening variable declaration, the two "g" functions
are not in the same batch of mutually recursive fun
www.eeworm.com/read/346512/11740206
tig test4.tig
/* define a recursive function */
let
/* calculate n! */
function nfactor(n: int): int =
if n = 0
then 1
else n * nfactor(n-1)
in
nfactor(10)
end
www.eeworm.com/read/346512/11740260
tig test47.tig
/* This is legal. The second type "a" simply hides the first one.
Because of the intervening variable declaration, the two "a" types
are not in the same batch of mutually recursive types.
S
www.eeworm.com/read/346512/11740295
tig test38.tig
/* This is illegal, since there are two types with the same name
in the same (consecutive) batch of mutually recursive types.
See also test47 */
let
type a = int
type a = string
in
0
end
www.eeworm.com/read/258562/11854905
f90 ex0828.f90
program ex0828
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/122674/14676220
h treescan.h
#ifndef TREE_SCANS
#define TREE_SCANS
#include "treenode.h"
#include "queue.h"
#include "stack.h"
#ifndef NULL
const int NULL = 0;
#endif // NULL
// preorder recursive scan of the n
www.eeworm.com/read/221868/14716960
f90 ex0828.f90
program ex0828
implicit none
integer :: n
integer, external :: fact
write(*,*) 'N='
read(*,*) n
write(*, "(I2,'! = ',I8)" ) n, fact(n)
stop
end
recursive integer function fac