代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/372762/9494449
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/169721/9845016
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/163337/10165785
pl recursion.pl
CONST a = 10;
var b,c;
procedure p;
procedure q;
begin
read(b);
c:=c+1;
write(c);
if b#0 then
call p
end;
begin
read(b);
c:=c+1;
w
www.eeworm.com/read/163337/10165805
lst recursion.lst
0:JMP 0 35
1:JMP 0 19
2:JMP 0 3
3:INT 0 3
4:OPR 0 16
5:STO 2 3
6:LOD 2 4
7:LIT 0 1
8:OPR 0 2
9:STO 2 4
10:LOD 2 4
11:OPR 0 14
12:OPR 0 15
13:LOD 2 3
14:LIT 0 0
15:OPR 0 9
16:
www.eeworm.com/read/356303/10232187
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/356292/10232327
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/278961/10485209
png recursion.png
www.eeworm.com/read/159990/10581533
class recursion.class
www.eeworm.com/read/159990/10581611
java recursion.java
//Recursion
class Fact
{
int Fact(int n)
{
if(n == 1)
{
return 1;
}
else
{
return Fact(n-1)*n;
}
}
}
class Recursion
{
public static void main(String args[])
www.eeworm.com/read/159990/10581744