代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/423856/10529337
cpp binarytree.cpp
#include "stdio.h"
#include "stdlib.h"
typedef struct node{
char ch;
struct node * lchild,*rchild;
}node,*tree;
int num;
void create(tree &t) //递归建立二叉树
{
char ch;
scanf("%c",&ch);
if(c
www.eeworm.com/read/371754/6964801
py queen.py
#八皇后问题递归解法
class EQueen:
num=0 #保存解的个数
data=range(0,8) #保存解
def isPlace(self,t): #判断t是否可以放置
for i in range(0,t):
if EQueen.data[i]==EQ
www.eeworm.com/read/461420/7227902
cpp source.cpp
//先序遍历二叉树的非递归算法
#include
#include
typedef struct node
{
char data;
struct node *lchild,*rchild;
}BinTNode;
typedef BinTNode *BinTree;
int count;
#define SSize 10
www.eeworm.com/read/460348/7253019
c bintree_preorder_rec.c
/* 二叉树前根周游的递归算法*/
#include
#include
typedef char DataType;
struct BinTreeNode; /* 二叉树中结点 */
typedef struct BinTreeNode *PBinTreeNode; /* 结点的指针类型
www.eeworm.com/read/460348/7253022
c bintree_postorder_rec.c
/* 二叉树后根周游的递归算法*/
#include
#include
typedef char DataType;
struct BinTreeNode; /* 二叉树中结点 */
typedef struct BinTreeNode *PBinTreeNode; /* 结点的指针
www.eeworm.com/read/485074/6572138
m oofcmf.m
function [u,j,f]=oofcmf(r,e,ce,k)%r为给定的值，e＝r，ce＝0,k=0
if(ce >= 1) %递归出口
{
f=1/1+j;
return f ;
}
end
x=0; %设置规则：if x is Ai
www.eeworm.com/read/480452/6664440
java parsea.java
//递归下降法 语法分析
import globle.DecKind;
import globle.Error;
import globle.ExpKind;
import globle.ExpType;
import globle.LexType;
import globle.NodeKind;
import globle.ParamType;
import globle.St
www.eeworm.com/read/223280/14648226
asm exam801.asm
;编写计算N!的程序,用到递归算法。
dseg segment
n db 3
result dw ?
dseg ends
sseg segment para stack
db 100 dup(?)
sseg ends
cseg segment
assume cs:cseg, ds:dseg, ss:sseg
start: mov ax,