代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/448997/7520400
cpp algo0903.cpp
Status SecondOptimal(BiTree &T, ElemType R[], float sw[],
int low, int high) { // 算法9.3
// 由有序表R[low..high]及其累计权值表sw
// (其中sw[0]==0)递归构造次优查找树T。
int i,j;
float m
www.eeworm.com/read/197276/8006351
m viterbidecoder.m
function [LLR,dec_outbits ] =ViterbiDecoder(Pn,rx_bits)
%Viterbi译码器,递归卷积码
global state_num;
global memory_len;
global state_inbits;
global state_outbits1;
global state_outbits2;
global alpha
www.eeworm.com/read/326430/13142699
cpp hannuota.cpp
//韩诺塔问题的递归实现
/*#include
#include
//using namespace std;//why????
ofstream fout("out.txt");
int count = 0;
void move(int n,char x,char y)
{
fout
www.eeworm.com/read/401461/11557474
java test.java
public class Test
{
public static void main(String[] args)
{
System.out.println("递归的使用！");
System.out.println("阶乘：");
System.out.println(f(5));
System.out.println("斐波那契数列第n个位置上的数值：");
www.eeworm.com/read/259473/11787731
cpp main.cpp
#include
int Site[8];//全局数组，标定位置
void Queen(int n);
int Judge(int n);
void Print();
void main()
{
cout
www.eeworm.com/read/127950/14326254
cpp 最优二叉搜索树.cpp
#include "iostream.h"
#include "make2db.h"
#include "fstream.h"
int **s;
double **w,**m;
//非递归
void obst(double *a,double *b,int n,double **m,int **s,double **w)
{
int i1,j1;
for(int
www.eeworm.com/read/225111/14555543
asv program.asv
clc
clear
%close all
X = rand(30,2)
%[alpha,b] = trainlssvm({X,Yc,type,gam,sig2,kernel_type,preprocess});
p0=chuidian(X,Y);
[w,b]=fenleixian(X,Y); %此处应有递归调用
pi=jiaodian(w,b);
n=
www.eeworm.com/read/223339/14644520
cpp algo0903.cpp
Status SecondOptimal(BiTree &T, ElemType R[], float sw[],
int low, int high) { // 算法9.3
// 由有序表R[low..high]及其累计权值表sw
// (其中sw[0]==0)递归构造次优查找树T。
int i,j;
float m
www.eeworm.com/read/219502/14878137
cpp algo0903.cpp
Status SecondOptimal(BiTree &T, ElemType R[], float sw[],
int low, int high) { // 算法9.3
// 由有序表R[low..high]及其累计权值表sw
// (其中sw[0]==0)递归构造次优查找树T。
int i,j;
float m
www.eeworm.com/read/116445/14969583
c bhh.c
/*八皇后问题的递归算法*/
#include
#include
#define N 8 /* 棋盘边长 */
#define XXN 15 /* 正（反）对角线个数 */
#define TRUE 1
#define FALSE 0
int map[N][N];/* 棋盘 */
int col[N]