代码搜索:recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/158865/5594140
x-djgpp
# translate the version string, so it can be used on DJGPP, where only
# one dot in filename is allowed
# to avoid recursion when redefining $(version)
_version:=$(version)
__version=$(subst ., ,$(_v
www.eeworm.com/read/172473/9706273
m rctrap.m
function T=rctrap(f,a,b,n)
%Input - f is the integrand input as a string 'f'
% - a and b are upper and lower limits of integration
% - n is the number of times for recursion
%Output - T
www.eeworm.com/read/334162/12628696
config
# This file contains a description of the codelets that compose fftw.
# NOTW is a list of the sizes that FFTW contains hard-coded transforms for
# (the "base cases" of the FFT recursion):
NOTW="1 2
www.eeworm.com/read/386291/8757641
java stacktriangle2.java
// stackTriangle2.java
// evaluates triangular numbers, stack replaces recursion
// to run this program: C>java StackTriangle2App
import java.io.*; // for I/O
/////////////////////
www.eeworm.com/read/361402/10054461
java stacktriangle2.java
// stackTriangle2.java
// evaluates triangular numbers, stack replaces recursion
// to run this program: C>java StackTriangle2App
import java.io.*; // for I/O
/////////////////////
www.eeworm.com/read/160819/10495163
cpp recfib.cpp
#include
using namespace std;
#include "prompt.h"
// Illustrates "bad" recursion for computing Fibonacci numbers
// and a global variable to count # function calls
int gFibCalls = 0;
lo
www.eeworm.com/read/239763/13258127
java stacktriangle2.java
// stackTriangle2.java
// evaluates triangular numbers, stack replaces recursion
// to run this program: C>java StackTriangle2App
import java.io.*; // for I/O
/////////////////////
www.eeworm.com/read/149876/5696255
c run.c
/*
* This simple classical example of recursion is useful for
* testing stack backtraces and such.
*/
#ifdef vxworks
# include
/* VxWorks does not supply atoi. */
static int
atoi (z)
www.eeworm.com/read/149876/5696617
c run.c
/*
* This simple classical example of recursion is useful for
* testing stack backtraces and such.
*/
#ifdef vxworks
# include
/* VxWorks does not supply atoi. */
static int
atoi (ch
www.eeworm.com/read/148694/5711693
c run.c
/*
* This simple classical example of recursion is useful for
* testing stack backtraces and such.
*/
#ifdef vxworks
# include
/* VxWorks does not supply atoi. */
static int
atoi (z)