代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/237997/13913584
c factor.c
/*
file name : factor.c
Description : 利用递归函数调用计算N 阶乘
ex : n = 3 时,递归函数执行如下 :
if ( n == 1)
return (1);
else
return( 3* Factorial(3-1) );
→
return( 2* Factoria
www.eeworm.com/read/237993/13914288
txt 清空目录算法.txt
function EmptyDirectory(TheDirectory :String ; Recursive : Boolean) :
Boolean;
var
SearchRec : TSearchRec;
Res : Integer;
begin
Result := False;
TheDirectory := NormalDir(TheDirectory);
Res :=
www.eeworm.com/read/201477/15407607
cpp rsum.cpp
// recursive sum of n numbers
#include
template
T Rsum(T a[], int n)
{// Return sum of numbers a[0:n - 1].
if (n > 0)
return Rsum(a, n-1) + a[n-1];
return
www.eeworm.com/read/201477/15407768
cpp rknap.cpp
// dynamic programming recursive knapsack
#include
#include // has max()
int p[6] = {0, 6, 3, 5, 4, 6};
int w[6] = {0, 2, 2, 6, 5, 4};
int x[6];
int n = 5;
int c =
www.eeworm.com/read/110993/15520734
cpp scoperes.cpp
//: C04:Scoperes.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Global scope resolution
www.eeworm.com/read/106262/15642137
cpp nonrec.cpp
#include
#include
#include
typedef struct elem {
int rd, pn, pf, q1, q2; // return address, n, f, u1, u2
} ELEM;
#include "..\include\book.h"
#inc
www.eeworm.com/read/106262/15642278
cpp toh.cpp
#include
#include
#include "..\include\book.h"
typedef int POLE;
#define move(X, Y) cout
www.eeworm.com/read/104361/15697156
tig test17.tig
/* error: definition of recursive types is interrupted */
let
/* define a tree */
type tree ={key: int, children: treelist}
var d:int :=0
type treelist = {hd: tree, tl: treelist}
in
d
end
www.eeworm.com/read/104361/15697157
tig test16.tig
/* error: mutually recursive types thet do not pass through record or array */
let
type a=c
type b=a
type c=d
type d=a
in
""
end
www.eeworm.com/read/104361/15697182
tig test5.tig
/* define valid recursive types */
let
/* define a list */
type intlist = {hd: int, tl: intlist}
/* define a tree */
type tree ={key: int, children: treelist}
type treelist = {hd: tree, tl: t