代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/133757/14025424
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/235107/14085544
java recursion.java
package dsa.recursion;
public class Recursion
{
public static void main(String[] args)
{
Recursion r = new Recursion();
System.out.println(r.f(10));
int[] c = new int[4];
www.eeworm.com/read/111220/15516722
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/109003/15568877
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/103497/15730236
cpp recursion.cpp
/*********************************************************************
*利用zhao等人论文原理的，使用递归方法的DCT程序 *
* *
*****************************************************
www.eeworm.com/read/389519/8515900
java gcd_recursion.java
//【习3.24】 将辗转相除法求两个整数的最大公因数gcd(a,b)用递归方法实现。
public class GCD_recursion
{
public static int gcd(int a,int b) //返回a,b的最大公因数
{
if (b==0)
return a;
www.eeworm.com/read/389519/8515902
class gcd_recursion.class
www.eeworm.com/read/285107/8868738
java recursion1.java
public class Recursion1{
static void hi(int n){
if(n
www.eeworm.com/read/285107/8869324
java recursion2.java
public class Recursion2{
int[][] map={{0, 0, 0, 0, 0, 0, 0, 1, 1, 0},
{0, 1, 1, 1, 1, 1, 0, 1, 0, 0},
{1, 0, 0, 0, 0, 1, 0, 0, 0, 0},
{0, 0, 0, 0, 1,