代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/172012/9726731
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/413044/11168987
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/266534/11220712
txt assist.hs.txt
-- Problem Assistance Required
-- Algorithm Recursion
-- Runtime O(n*l(n)) where l(n) is the number of lucky numbers
www.eeworm.com/read/266534/11220828
txt danger.hs.txt
-- Problem In Danger
-- Algorithm Recursion
-- Runtime O(log(n))
-- Author Walter Guttmann
-- Date 06.05.2001
main :: IO ()
main =
do input
www.eeworm.com/read/105271/15672969
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/433047/8549997
log testsqg.log
>> test_quadg
f =
2.00001659104794
correct_ans =
2
f =
1.99999999999989
correct_ans =
2
f =
1.99999999999999
correct_ans =
2
f =
2.00000000000000
corre
www.eeworm.com/read/365779/9848655
log testsqg.log
>> test_quadg
f =
2.00001659104794
correct_ans =
2
f =
1.99999999999989
correct_ans =
2
f =
1.99999999999999
correct_ans =
2
f =
2.00000000000000
corre
www.eeworm.com/read/353255/10459268
log testsqg.log
>> test_quadg
f =
2.00001659104794
correct_ans =
2
f =
1.99999999999989
correct_ans =
2
f =
1.99999999999999
correct_ans =
2
f =
2.00000000000000
corre
www.eeworm.com/read/458682/7291765
sh self-source.sh
#!/bin/bash
# self-source.sh: a script sourcing itself "recursively."
# From "Stupid Script Tricks," Volume II.
MAXPASSCNT=100 # Maximum number of execution passes.
echo -n "$pass_count "
# At
www.eeworm.com/read/119864/6081592
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