代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/114189/15065604
cpp pre.cpp
/* 二叉树前序遍历的递归算法*/
#include
#include
typedef char DataType;
struct BinTreeNode; /* 二叉树中结点 */
typedef struct BinTreeNode *PBinTreeNode; /* 结点的指针类型
www.eeworm.com/read/11251/214690
c 10_04.c
/*【例10-4】写出下列递归程序的输出结果。*/
#include
long fib(int g)
{
switch(g){
case 0: return 0;
case 1:
case 2: return 2;
}
printf("g=%d,", g);
return
www.eeworm.com/read/472897/6859523
cpp seqalignment2.cpp
//动态规划 递归 序列比对
//得分矩阵：匹配+1，失配0，空位-1
# include
# include
# define SEQULEN 23
int scores[SEQULEN][SEQULEN]={0};
char sequ1[SEQULEN+1]={"GAAGGTTCCCGCCGCTATCGTAT"},
seq
www.eeworm.com/read/204479/15337825
c bintree_preorder_rec.c
/* 二叉树前根周游的递归算法*/
#include
#include
typedef char DataType;
struct BinTreeNode; /* 二叉树中结点 */
typedef struct BinTreeNode *PBinTreeNode; /* 结点的指针类型
www.eeworm.com/read/204479/15337829
c bintree_postorder_rec.c
/* 二叉树后根周游的递归算法*/
#include
#include
typedef char DataType;
struct BinTreeNode; /* 二叉树中结点 */
typedef struct BinTreeNode *PBinTreeNode; /* 结点的指针
www.eeworm.com/read/390464/8464559
4
//后序遍历二叉树的非递归算法.
#include
#include
#include
#define OVERFLOW 0
#define STACKSIZE 50
#define ADD 20
typedef struct BiTNode
{
int sign;
char data;
www.eeworm.com/read/286954/8735143
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/285689/8822595
c creatree.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/285689/8822602
c posttree.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/285689/8822607
c pretree.c
#include
#define m 3
typedef char datatype;
typedef struct node {
datatype data;
struct node *child[m];
} node,*tree;
void createtree(tree *p)
{/*按前序遍历顺序建立一棵3度树的递归算法*/