代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/285689/8822617
c leveltree.c
#include
#define m 3
typedef char datatype;
typedef struct node {
datatype data;
struct node *child[m];
} node,*tree;
void createtree(tree *p)
{/*按前序遍历顺序建立一棵3度树的递归算法*/
www.eeworm.com/read/382800/8999942
java recurmatrixchain.java
public class RecurMatrixChain {
public static int p[]; /* 矩阵链 */
public static int s[][]; /* 记录断点的矩阵 */
public static int Count[][]; /* 记录子区间被重复计算的次数 */
/* 用递归算法计算最优矩阵链乘问题 */
public
www.eeworm.com/read/380937/9121874
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/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/364039/9923631
java hanovertowers.java
import java.io.IOException;
//汉诺塔，采用递归的方式实现
public class HanoverTowers {
public static void print_disks(int n){
System.out.print("disks:"+n+" :");
}
public static void print_moves(char sr
www.eeworm.com/read/416348/10002162
cpp ep7_14.cpp
/*7.14 编写函数模板，用递归方法求二叉树的深度。*/
#include
#include
using namespace std;
templateclass BinaryTree;
templateclass Node{
Node *lchild,*rchild;
T inf
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/424004/10508816
cpp ex7_15.cpp
//【例7.15】二叉排序树查找函数。递归慢，下面给出迭代的查找算法。
#include
#include
using namespace std;
templateclass BinaryTree;
templateclass Node{
Node *lchild,*rchild;