代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/444091/7618094
c hermite.c
/*
** Compute the value of a Hermite polynomial
**
** Inputs:
** n, x: identifying values
**
** Output:
** value of polynomial (return value)
*/
int
hermite( int n, int x )
{
/*
**
www.eeworm.com/read/436521/7768623
c hermite.c
/*
** Compute the value of a Hermite polynomial
**
** Inputs:
** n, x: identifying values
**
** Output:
** value of polynomial (return value)
*/
int
hermite( int n, int x )
{
/*
**
www.eeworm.com/read/333254/12693162
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/245818/12779223
c factor.c
// factor.c -- uses loops and recursion to calculate factorials
#include
long fact(int n);
long rfact(int n);
int main(void)
{
int num;
printf("This program calculates facto
www.eeworm.com/read/144399/12797673
m adaptsimpson.m
function I = adaptSimpson(fun,a,b,tol,maxLevel,level)
% adaptSimpson Adaptive numerical integration based on Simpson's rule
%
% Synopsis: I = adaptSimpson(fun,a,b)
% I = adaptSimpson(
www.eeworm.com/read/144399/12797708
m adaptsimpsontrace.m
function [I,x] = adaptSimpsonTrace(fun,a,b,tol,maxLevel,level)
% adaptSimpsonTrace Adaptive numerical integration based on Simpson's rule
%
% Synopsis: [I,x] = adaptSimpson(fun,a,b)
%
www.eeworm.com/read/142539/12940932
c fig1_3.c
#include
/* START: fig1_3.txt */
int
Bad( unsigned int N )
{
/* 1*/ if( N == 0 )
/* 2*/ return 0;
else
/* 3*/ return Bad( N / 3 +