代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/421976/10673221
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/275035/10838466
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/274170/10886366
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/273268/10921538
cpp ex7_15.cpp
//【例7.15】二叉排序树查找函数。递归慢，下面给出迭代的查找算法。
#include
#include
using namespace std;
templateclass BinaryTree;
templateclass Node{
Node *lchild,*rchild;
www.eeworm.com/read/460348/7252977
c simknap_nrec.c
/* 简化背包问题的非递归算法*/
#include
#include
#define MAXNUM 20
#define TRUE 1
#define FALSE 0
struct NodeBag { /* 栈中元素的定义 */
int s , n ;
int r ; /* r的值
www.eeworm.com/read/460348/7252992
c bintree_inorder_rec.c
/* 二叉树对称根周游的递归算法*/
#include
#include
typedef char DataType;
struct BinTreeNode; /* 二叉树中结点 */
typedef struct BinTreeNode *PBinTreeNode; /* 结点的指针类
www.eeworm.com/read/456386/7350050
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/299539/7845857
java deletenode.java
import java.sql.*;
//import com.microsoft.jdbc.*; // 加载类库
public class deletenode{
//定义全局变量
//构造函数，初始化
public deletenode()
{
System.out.println("开始运行递归删除程序");
}
//总循环
p