代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/212723/15150759
m twosgconstrained.m
% J.C. Spall, Sept. 1998
% twoSGconstrained
% Code for evaluation of second-order SGSA (2SGSA) versus first-order
% SGSA (1SGSA, as in Chap. 5 of ISSO). Code is for comparative evaluation purpose
www.eeworm.com/read/169063/5428878
h nameser_compat.h
/* Copyright (c) 1983, 1989
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are perm
www.eeworm.com/read/168945/5429325
h nameser_compat.h
/* Copyright (c) 1983, 1989
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are perm
www.eeworm.com/read/162614/5528571
c 20010423-1.c
/* Origin: PR c/2618 from Cesar Eduardo Barros ,
adapted to a testcase by Joseph Myers .
Boolean conversions were causing infinite recursion between conve
www.eeworm.com/read/474431/6809272
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/473080/6855040
inf avrcdc.inf
; Windows USB CDC Setup File
; Copyright (c) 2000 Microsoft Corporation
; Copyright (c) 2006 Recursion Co., Ltd.
[Version]
Signature="$Windows NT$"
Class=Ports
ClassGuid={4D36E978-E325-11C
www.eeworm.com/read/471682/6887933
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/192840/8269864
inf avrcdc.inf
; Windows USB CDC Setup File
; Copyright (c) 2000 Microsoft Corporation
; Copyright (c) 2006 Recursion Co., Ltd.
[Version]
Signature="$Windows NT$"
Class=Ports
ClassGuid={4D36E978-E325-11C
www.eeworm.com/read/292920/8323989
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/172012/9726706
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(