代码搜索:recursive

找到约 2,177 项符合「recursive」的源代码

代码结果 2,177
www.eeworm.com/read/456367/7350693

cpp recur.cpp

// recur.cpp -- use recursion #include void countdown(int n); int main() { countdown(4); // call the recursive function return 0; } void countdown(int n) {
www.eeworm.com/read/456367/7350977

cpp recur.cpp

// recur.cpp -- use recursion #include void countdown(int n); int main() { countdown(4); // call the recursive function return 0; } void countdown(int n) {
www.eeworm.com/read/452695/7436347

c program9_06.c

/* Program 9.6 Calculating factorials using recursion */ #include unsigned long factorial(unsigned long); int main(void) { unsigned long number = 0L; printf("\nEnter an integer
www.eeworm.com/read/449504/7503128

m recresid_d.m

% PURPOSE: demo of recresid() % Recursive residuals % %--------------------------------------------------- % USAGE: recresid_d %--------------------------------------------------- n = 100;
www.eeworm.com/read/449504/7503134

m cusums.m

function result = cusums(y,x) % PURPOSE: computes cusum-squares test % --------------------------------------- % USAGE: result = cusums(y,x) % where: y = dependent variable (n x 1) %
www.eeworm.com/read/439651/7704270

m fact02.m

function output = fact02(n) % FACT2 Calculate factorial of a given positive integer (recursive version) if n == 1, % Terminating condition output = 1; return; end output = n*fact02(n-1);
www.eeworm.com/read/437118/7754823

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 6 end
www.eeworm.com/read/437118/7754824

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/437118/7754851

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: treelist
www.eeworm.com/read/399279/7875830

f90 e_624_02.f90

INTEGER :: n=0 CHARACTER(LEN=1) :: a,b,c a='A';b='B';c ='C' DO WHILE(n