代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/478348/6715203
m iforgot.m
function iforgot(n)
%IFORGOT Recursive Function Call Example.
%
% D.C. Hanselman, University of Maine, Orono, ME, 04469
% 1/25/95
% Copyright (c) 1996 by Prentice-Hall, Inc.
if nargin==0,n=20;end
if
www.eeworm.com/read/477052/6744636
c bitcnts.c
/* +++Date last modified: 05-Jul-1997 */
/*
** BITCNTS.C - Test program for bit counting functions
**
** public domain by Bob Stout & Auke Reitsma
*/
#include
#include
#includ
www.eeworm.com/read/407616/11413445
f90 e_624_01.f90
PROGRAM CALL_FACTORlAL !调用FACTORIAL函数的主程序
INTERFACE
RECURSIVE FUNCTION FACTORIAL(N) RESULT(F_RES)
INTEGER :: N,F_RES
END FUNCTION FACTORIAL
END INTERFACE
INTEGER ::N
WRITE(*,'(A,$)
www.eeworm.com/read/407116/11429184
f90 e_624_01.f90
PROGRAM CALL_FACTORlAL !调用FACTORIAL函数的主程序
INTERFACE
RECURSIVE FUNCTION FACTORIAL(N) RESULT(F_RES)
INTEGER :: N,F_RES
END FUNCTION FACTORIAL
END INTERFACE
INTEGER ::N
WRITE(*,'(A,$)
www.eeworm.com/read/402286/11539158
m iforgot.m
function iforgot(n)
%IFORGOT Recursive Function Call Example.
%
% D.C. Hanselman, University of Maine, Orono, ME, 04469
% 1/25/95
% Copyright (c) 1996 by Prentice-Hall, Inc.
if nargin==0,n=20;end
if
www.eeworm.com/read/346512/11740192
tig test7.tig
/* define valid mutually recursive functions */
let
function do_nothing1(a: int, b: string):int=
(do_nothing2(a+1);0)
function do_nothing2(d: int):string =
(do_nothing1(d, "str");" ")
in
do_no
www.eeworm.com/read/346512/11740264
tig test6.tig
/* define valid mutually recursive procedures */
let
function do_nothing1(a: int, b: string)=
do_nothing2(a+1)
function do_nothing2(d: int) =
do_nothing1(d, "str")
in
do_nothing1(0, "str2")
en
www.eeworm.com/read/346512/11740572
tig test18.tig
/* error : definition of recursive functions is interrupted */
let
function do_nothing1(a: int, b: string):int=
(do_nothing2(a+1);0)
var d:=0
function do_nothing2(d: int):string =
(do_nothing1(
www.eeworm.com/read/156529/11793989
m iforgot.m
function iforgot(n)
%IFORGOT Recursive Function Call Example.
%
% D.C. Hanselman, University of Maine, Orono, ME, 04469
% 1/25/95
% Copyright (c) 1996 by Prentice-Hall, Inc.
if nargin==0,n=20;end
if
www.eeworm.com/read/155122/11897199
m iforgot.m
function iforgot(n)
%IFORGOT Recursive Function Call Example.
%
% D.C. Hanselman, University of Maine, Orono, ME, 04469
% 1/25/95
% Copyright (c) 1996 by Prentice-Hall, Inc.
if nargin==0,n=20;end
if