代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/204479/15337754
c tree_inorder_rec.c
/* 树的中根周游的递归算法*/
#include
#define MAXNUM 20
#define null -1
/* typedef int DataType; */
struct ParTreeNode {
/*DataType info; 结点中的元素 */
int parent; /* 结点的父结点位置 */
}
www.eeworm.com/read/204479/15337804
c tree_postorder_rec.c
/* 树的后根周游的递归算法*/
#include
#define MAXNUM 20
#define null -1
/* typedef int DataType; */
struct ParTreeNode {
/*DataType info; 结点中的元素 */
int parent; /* 结点的父结点位置 */
};
www.eeworm.com/read/204479/15337818
c simknap_rec.c
/* 简化背包问题的递归算法*/
#include
#include
int knap(int s, int n, int w[]) {
if ( s == 0 )
return (1);
else if ( s0 && n
www.eeworm.com/read/201037/15417976
cpp quicksort.cpp
#include
#include "datatype.h"
void QuickSort(datatype a[], int low, int high)
//用递归方法对对象a[low]--a[high]进行快速排序
{
int i, j;
datatype temp;
i = low;
j = high;
temp = a[low
www.eeworm.com/read/200367/15434697
m fractree.m
function Fractree(ss,ms,sf,A);
% 递归法生成分形树
% ss is Starting size
% ms is Minimum Size
% sf is Shrink Factor
% A is Angle
A=A/180*pi;
L=ss;
jd=pi/2;
z=0;
cla;
hold on;
[z,jd,L]=r
www.eeworm.com/read/111298/15514836
cpp quicksort.cpp
#include
#include "datatype.h"
void QuickSort(datatype a[], int low, int high)
//用递归方法对对象a[low]--a[high]进行快速排序
{
int i, j;
datatype temp;
i = low;
j = high;
temp = a[low
www.eeworm.com/read/371169/9563812
c 三 hill.c
/********************************************************************/
#define N 4 /*[注]：修改4为你所要的矩阵阶数*/
#include "stdio.h"
#include "conio.h"
/*js()函数用于计算行列式,通过递归算法实现*/
int js(s,n)
int
www.eeworm.com/read/274763/10853897
h sc.h
//二叉树存储结构定义
typedef struct bitnode
{
char data;
struct bitnode *lchild,*rchild;
}bitnode,*bitree;
//先序遍历递归算法
void preorder(bitree t)
{
if(t)
{
coutlchild);
www.eeworm.com/read/274763/10853900
h change.h
//二叉树存储结构定义
typedef struct bitnode
{
char data;
struct bitnode *lchild,*rchild;
}bitnode,*bitree;
//先序遍历递归算法
void preorder(bitree t)
{
if(t)
{
coutlchild);
www.eeworm.com/read/274763/10853907
h bt.h
///二叉树存储结构定义
typedef struct bitnode
{
char data;
struct bitnode *lchild,*rchild;
}bitnode,*bitree;
//先序遍历递归算法
void preorder(bitree t)
{
if(t)
{
coutlchild)