代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/390464/8464529
2
//中序遍历非递归算法
#include
#include
#include
#define OVERFLOW 0
#define STACKSIZE 50
#define ADD 20
typedef struct BiTNode
{
char data;
struct BiTNode *l
www.eeworm.com/read/390464/8464550
5
//层次遍历的非递归算法
#include
#include
#include
#include
#define N 50
#define OVERFLOW 0
#define NULL 0
typedef struct BiTNode
{
char data;
st
www.eeworm.com/read/289579/8541642
c 二进制数.c
/*递归法求二进制数*/
#include
void printb(int x,int n);
void main()
{
int x;
printf("input number:");
scanf("%d",&x);
printf("number of decimal form: %d\n",x);
www.eeworm.com/read/431296/8690626
c 9.26.c
9.26② 试将折半查找算法改写成递归算法。
实现下列函数：
int BinSearch(SSTable s, int low, int high, KeyType k);
/* Index the element which key is k */
/* in StaticSearchTable s. */
/* Return 0 if x is not
www.eeworm.com/read/185294/9044460
htm s05_10.htm
递归函数-求n!
function factorial(n)
{//求阶乘,n!=n*(n-1)!
if (n
www.eeworm.com/read/376627/9311548
c 二进制数.c
/*递归法求二进制数*/
#include
void printb(int x,int n);
void main()
{
int x;
printf("input number:");
scanf("%d",&x);
printf("number of decimal form: %d\n",x);
www.eeworm.com/read/363342/9958098
c 二进制数.c
/*递归法求二进制数*/
#include
void printb(int x,int n);
void main()
{
int x;
printf("input number:");
scanf("%d",&x);
printf("number of decimal form: %d\n",x);
www.eeworm.com/read/276181/10758315
c 二进制数.c
/*递归法求二进制数*/
#include
void printb(int x,int n);
void main()
{
int x;
printf("input number:");
scanf("%d",&x);
printf("number of decimal form: %d\n",x);
www.eeworm.com/read/460348/7252976
c tree_preorder_rec.c
/* 树的后根周游的递归算法*/
#include
#include
#define MAXNUM 20
#define null -1
/* typedef int DataType; */
struct ParTreeNode {
/*DataType info; 结点中的元素 */
int paren